Sciweavers

1503 search results - page 300 / 301
» Self-optimizing distributed trees
Sort
View
VLDB
2002
ACM
131views Database» more  VLDB 2002»
13 years 7 months ago
ProTDB: Probabilistic Data in XML
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
Andrew Nierman, H. V. Jagadish
PR
2007
142views more  PR 2007»
13 years 6 months ago
Visual guided navigation for image retrieval
In this work, we are interested in technologies that will allow users to actively browse and navigate large image databases and to retrieve images through interactive fast browsin...
Guoping Qiu, Jeremy Morris, Xunli Fan
JEI
2008
109views more  JEI 2008»
13 years 5 months ago
New approach for liveness detection in fingerprint scanners based on valley noise analysis
Recent research has shown that it is possible to spoof a variety of fingerprint scanners using some simple techniques with molds made from plastic, clay, Play-Doh, silicon, or gela...
Bozhao Tan, Stephanie A. C. Schuckers
TDSC
2010
218views more  TDSC 2010»
13 years 5 months ago
Secure Data Objects Replication in Data Grid
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
Manghui Tu, Peng Li, I-Ling Yen, Bhavani M. Thurai...
FOCS
2010
IEEE
13 years 5 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin