Sciweavers

8311 search results - page 1293 / 1663
» Phase-Based Information Retrieval
Sort
View
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
16 years 7 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 7 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 7 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
16 years 7 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 7 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
« Prev « First page 1293 / 1663 Last » Next »