Sciweavers

2996 search results - page 211 / 600
» Numberings and Randomness
Sort
View
VLDB
2002
ACM
108views Database» more  VLDB 2002»
15 years 6 months ago
Adaptive Index Structures
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
Yufei Tao, Dimitris Papadias
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
16 years 1 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
PG
2007
IEEE
16 years 26 days ago
Statistical Hypothesis Testing for Assessing Monte Carlo Estimators: Applications to Image Synthesis
Image synthesis algorithms are commonly compared on the basis of running times and/or perceived quality of the generated images. In the case of Monte Carlo techniques, assessment ...
Kartic Subr, James Arvo
ACNS
2011
Springer
237views Cryptology» more  ACNS 2011»
14 years 10 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...
CCS
2006
ACM
15 years 10 months ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo