Sciweavers

69 search results - page 6 / 14
» Maximal Intersection Queries in Randomized Input Models
Sort
View
112
Voted
WWW
2010
ACM
15 years 7 months ago
Diversifying web search results
Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results. However,...
Davood Rafiei, Krishna Bharat, Anand Shukla
161
Voted
ACNS
2011
Springer
237views Cryptology» more  ACNS 2011»
14 years 4 months ago
Private Discovery of Common Social Contacts
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
Emiliano De Cristofaro, Mark Manulis, Bertram Poet...
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 23 days 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
90
Voted
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 6 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
16 years 1 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...