Sciweavers

3544 search results - page 361 / 709
» Rethinking the Presentation of Results from Web Search
Sort
View
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
16 years 23 days ago
Anytime RRTs
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
Dave Ferguson, Anthony Stentz
INFOCOM
2009
IEEE
16 years 1 months ago
Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...
Mohammad Behdadfar, Hossein Saidi, Hamid Alaei, Ba...
WSDM
2010
ACM
236views Data Mining» more  WSDM 2010»
16 years 4 months ago
Personalized Click Prediction in Sponsored Search
Sponsored search is a multi-billion dollar business that generates most of the revenue for search engines. Predicting the probability that users click on ads is crucial to sponsor...
Erick Cantú-Paz, Haibin Cheng
201
Voted
EDBT
2009
ACM
184views Database» more  EDBT 2009»
16 years 1 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
3DIM
2003
IEEE
15 years 10 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick