Sciweavers

1689 search results - page 126 / 338
» Proximate point searching
Sort
View
SIGIR
2009
ACM
16 years 1 days ago
Learning to rank for quantity consensus queries
Web search is increasingly exploiting named entities like persons, places, businesses, addresses and dates. Entity ranking is also of current interest at INEX and TREC. Numerical ...
Somnath Banerjee, Soumen Chakrabarti, Ganesh Ramak...
CIKM
2004
Springer
15 years 11 months ago
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
Farnoush Banaei Kashani, Cyrus Shahabi
CVPR
2003
IEEE
16 years 7 months ago
Implicit Meshes for Modeling and Reconstruction
Explicit surfaces, such as triangulations or wireframe models, have been extensively used to represent the deformable 3?D models that are used to fit 3?D point and 2?D silhouette ...
Slobodan Ilic, Pascal Fua
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
15 years 11 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
IROS
2006
IEEE
106views Robotics» more  IROS 2006»
15 years 11 months ago
Where to Build a Door
— A room is a simple polygon with a prespecified point, called the door, on its boundary. Search starts at the door, and must detect any intruder that may be in the room, while ...
John Z. Zhang, Tsunehiko Kameda