Sciweavers

991 search results - page 42 / 199
» Analyzing URL queries
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 11 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
PVLDB
2008
146views more  PVLDB 2008»
13 years 9 months ago
Efficient search for the top-k probable nearest neighbors in uncertain databases
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
ICDT
2009
ACM
109views Database» more  ICDT 2009»
14 years 10 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
14 years 10 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
WWW
2005
ACM
14 years 10 months ago
Information search and re-access strategies of experienced web users
Experienced web users have strategies for information search and re-access that are not directly supported by web browsers or search engines. We studied how prevalent these strate...
Anne Aula, Mika Käki, Natalie Jhaveri