Sciweavers

204 search results - page 9 / 41
» Probabilistic Attributed Hashing
Sort
View
DATAMINE
2007
93views more  DATAMINE 2007»
13 years 8 months ago
Evaluation of ordinal attributes at value level
We propose a novel context sensitive algorithm for evaluation of ordinal attributes which exploits the information hidden in ordering of attributes’ and class’ values and prov...
Marko Robnik-Sikonja, Koen Vanhoof
SCN
2008
Springer
157views Communications» more  SCN 2008»
13 years 8 months ago
Insider attack attribution using signal strength-based hyperbolic location estimation
A rogue insider, in a wireless network, is an authenticated member that exploits possession of a valid identity in order to launch an attack. A typical example is the transmission...
Christine Laurendeau, Michel Barbeau
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 3 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 6 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
PAMI
2006
132views more  PAMI 2006»
13 years 8 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...