Concept

Recherche des plus proches voisins

Publications associées (167)

Learning anisotropic filters on product graphs

Pascal Frossard, Clément Arthur Yvon Vignac

The extension of convolutional neural networks to irregular domains has pavedthe way to promising graph data analysis methods. It has however come at theexpense of a reduced representation power, as most of these new network archi-tectures can only learn i ...

2019

HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces

Akhil Arora, Arnab Bhattacharya, Piyush Kumar

Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary to practically solve the problem of nearest neighbor search. In this pap ...

ASSOC COMPUTING MACHINERY2018

Combining Range and Direction for Improved Localization

Martin Vetterli, Adam James Scholefield, Robin Scheibler, Gilles Baechler, Frederike Dümbgen, Miranda Krekovic, Golnooshsadat Elhami

Self-localization of nodes in a sensor network is typically achieved using either range or direction measurements; in this paper, we show that a constructive combination of both improves the estimation. We propose two localization algorithms that make use ...

2018

New Multi-Keyword Ciphertext Search Method for Sensor Network Cloud Platforms

Jiyong Zhang, Yue Wang, Hongyu Yang

This paper proposed a multi-keyword ciphertext search, based on an improved-quality hierarchical clustering (MCS-IQHC) method. MCS-IQHC is a novel technique, which is tailored to work with encrypted data. It has improved search accuracy and can self-adapt ...

MDPI2018

Spectral MAB for Unknown Graph Processes

Pascal Frossard, Laura Toni

In this work, we study graph-based multi-arms bandit (MAB) problems aimed at optimizing actions on irregular and high-dimensional graphs. More formally, we consider a decision-maker that takes sequential actions over time and observes the experienced rewar ...

IEEE Computer Society2018

An Eight lanes 7Gb/s/pin Source Synchronous Single-Ended RX with Equalization and Far-End Crosstalk Cancellation for Backplane Channels

Volkan Cevher, Cosimo Aprile, Yusuf Leblebici, Alessandro Cevrero, Lukas Kull, Thomas Toifl

This paper presents a versatile crosstalk cancellation scheme for single-ended multi-lane backplane links. System-level investigations show that a scheme, which combines analog filters and decision-feedback crosstalk compensation on the receiver (RX) side ...

2018

Geodesic Convolutional Shape Optimization

Pascal Fua, François Fleuret, Pierre Bruno Baqué, Edoardo Remelli

Aerodynamic shape optimization has many industrial applications. Existing methods, however, are so computationally demanding that typical engineering practices are to either simply try a limited number of hand-designed shapes or restrict oneself to shapes ...

2018

Magnetic exchange parameters and anisotropy of the quasi-two-dimensional antiferromagnet NiPS3

Diane Virginie Marie Lançon

Neutron inelastic scattering has been used to measure the magnetic excitations in powdered NiPS3, a quasitwo-dimensional antiferromagnet with spin S = 1 on a honeycomb lattice. The spectra show clear, dispersive magnons with a similar to 7 meV gap at the B ...

AMER PHYSICAL SOC2018

Text Similarity in Vector Space Models: A Comparative Study

Kenneth Younge, Omid Shahmirzadi, Adam Lugowski

Automatic measurement of semantic text similarity is an important task in natural language processing. In this paper, we evaluate the performance of different vector space models to perform this task. We address the real-world problem of modeling patent-to ...

2018

Collaborative Filtering Under a Sybil Attack: Similarity Metrics do Matter!

Rachid Guerraoui, Anne-Marie Kermarrec, Davide Frey, Antoine Rault, Florestan Laurentin Marie De Moor

Recommendation systems help users identify interesting content, but they also open new privacy threats. In this paper, we deeply analyze the effect of a Sybil attack that tries to infer information on users from a user-based collaborative-filtering recomme ...

IEEE2018

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search