Sciweavers

5169 search results - page 216 / 1034
» Locality approximation using time
Sort
View
IPPS
2003
IEEE
15 years 11 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
FOCS
2004
IEEE
15 years 10 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
WWW
2005
ACM
16 years 7 months ago
Improving Web search efficiency via a locality based static pruning method
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Edleno Silva de Moura, Célia Francisca dos ...
TMC
2008
83views more  TMC 2008»
15 years 6 months ago
Secure Location Verification with Hidden and Mobile Base Stations
In this work, we propose and analyse a new approach for securing localization and location verification in wireless networks based on hidden and mobile base stations. Our approach ...
Srdjan Capkun, Kasper Bonne Rasmussen, Mario Cagal...
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 10 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...