Sciweavers

151 search results - page 28 / 31
» Expected-case complexity of approximate nearest neighbor sea...
Sort
View
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
CIKM
2006
Springer
13 years 9 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen
CVPR
2009
IEEE
15 years 2 months ago
Reducing JointBoost-Based Multiclass Classification to Proximity Search
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
Alexandra Stefan (University of Texas at Arlington...
NN
1998
Springer
148views Neural Networks» more  NN 1998»
13 years 7 months ago
ARTMAP-IC and medical diagnosis: Instance counting and inconsistent cases
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...
Gail A. Carpenter, Natalya Markuzon
AMR
2008
Springer
248views Multimedia» more  AMR 2008»
13 years 9 months ago
Mobile Museum Guide Based on Fast SIFT Recognition
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
Boris Ruf, Effrosini Kokiopoulou, Marcin Detynieck...