Sciweavers

3420 search results - page 212 / 684
» Proximity Search in Databases
Sort
View
WWW
2008
ACM
14 years 11 months ago
Mining the search trails of surfing crowds: identifying relevant websites from user activity
The paper proposes identifying relevant information sources from the history of combined searching and browsing behavior of many Web users. While it has been previously shown that...
Mikhail Bilenko, Ryen W. White
SAINT
2002
IEEE
14 years 3 months ago
On Updating in Very Short Time by Distributed Search Engines
Almost conventional search engines employ centralized architecture. However, such an engine is not suitable for fresh information retrieval because it spends a long time to collec...
Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, Hi...
TKDE
2012
227views Formal Methods» more  TKDE 2012»
12 years 1 months ago
Publishing Search Logs - A Comparative Study of Privacy Guarantees
—Search engine companies collect the “database of intentions”, the histories of their users’ search queries. These search logs are a gold mine for researchers. Search engin...
Michaela Götz, Ashwin Machanavajjhala, Guozha...
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
15 years 3 days ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
15 years 3 days ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou