Sciweavers

1088 search results - page 127 / 218
» Probabilistic query expansion using query logs
Sort
View
PODS
2007
ACM
225views Database» more  PODS 2007»
14 years 9 months ago
Sketching unaggregated data streams for subpopulation-size queries
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
Edith Cohen, Nick G. Duffield, Haim Kaplan, Carste...
IROS
2007
IEEE
206views Robotics» more  IROS 2007»
14 years 3 months ago
Dexterous manipulation planning using probabilistic roadmaps in continuous grasp subspaces
— In this paper, we propose a new method for the motion planning problem of rigid object dexterous manipulation with a robotic multi-fingered hand, under quasi-static movement a...
Jean-Philippe Saut, Anis Sahbani, Sahar El-Khoury,...
RECOMB
2009
Springer
14 years 9 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
Tetsuo Shibuya
CLEF
2000
Springer
14 years 1 months ago
Cross-Language Retrieval for the CLEF Collections - Comparing Multiple Methods of Retrieval
For our participation in CLEF, the Berkeley group participated in the monolingual, multilingual and GIRT tasks. To help enrich the CLEF relevance set for future training, we prepa...
Fredric C. Gey, Hailing Jiang, Vivien Petras, Aita...
FOCS
2006
IEEE
14 years 3 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk