Sciweavers

6095 search results - page 221 / 1219
» Learning in Local Search
Sort
View
142
Voted
ICPP
2008
IEEE
15 years 11 months ago
Bounded LSH for Similarity Search in Peer-to-Peer File Systems
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
Yu Hua, Bin Xiao, Dan Feng, Bo Yu
WEBDB
2007
Springer
159views Database» more  WEBDB 2007»
15 years 11 months ago
A clustering-based sampling approach for refreshing search engine's database
Due to resource constraints, search engines usually have difficulties keeping the local database completely synchronized with the Web. To detect as many changes as possible, the ...
Qingzhao Tan, Ziming Zhuang, Prasenjit Mitra, C. L...
TLT
2008
93views more  TLT 2008»
15 years 5 months ago
What Do You Prefer? Using Preferences to Enhance Learning Technology
While the growing number of learning resources increases the choice for learners on how, what and when to learn, it also makes it more and more difficult to find the learning resou...
Philipp Kärger, Daniel Olmedilla, Fabian Abel...
WWW
2008
ACM
16 years 6 months ago
Spatial variation in search engine queries
Local aspects of Web search -- associating Web content and queries with geography -- is a topic of growing interest. However, the underlying question of how spatial variation is m...
Lars Backstrom, Jon M. Kleinberg, Ravi Kumar, Jasm...
NIPS
1998
15 years 6 months ago
Lazy Learning Meets the Recursive Least Squares Algorithm
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...
Mauro Birattari, Gianluca Bontempi, Hugues Bersini