Sciweavers

SIGPRO
2011
249views Hardware» more  SIGPRO 2011»
13 years 3 months ago
Extracting biometric binary strings with minimal area under the FRR curve for the hamming distance classifier
Quantizing real-valued templates into binary strings is a fundamental step in biometric compression and template protection. In this paper, we introduce the area under the FRR cur...
C. Chen, R. Veldhuis
SIGMOD
2011
ACM
279views Database» more  SIGMOD 2011»
13 years 3 months ago
MOBIES: mobile-interface enhancement service for hidden web database
Many web databases are hidden behind form-based interfaces which are not always easy-to-use on mobile devices because of limitations such as small screen sizes, trickier text entr...
Xin Jin, Aditya Mone, Nan Zhang 0004, Gautam Das
SIGMOD
2011
ACM
290views Database» more  SIGMOD 2011»
13 years 3 months ago
Database state generation via dynamic symbolic execution for coverage criteria
Automatically generating sufficient database states is imperative to reduce human efforts in testing database applications. Complementing the traditional block or branch coverage...
Kai Pan, Xintao Wu, Tao Xie
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
13 years 3 months ago
FlexMin: a flexible tool for automatic bug isolation in DBMS software
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
Kristi Morton, Nicolas Bruno
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
13 years 3 months ago
Flexible aggregate similarity search
Aggregate similarity search, a.k.a. aggregate nearest neighbor (Ann) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects...
Yang Li, Feifei Li, Ke Yi, Bin Yao 0002, Min Wang
SIGMOD
2011
ACM
242views Database» more  SIGMOD 2011»
13 years 3 months ago
The SystemT IDE: an integrated development environment for information extraction rules
Information Extraction (IE) — the problem of extracting structured information from unstructured text — has become the key enabler for many enterprise applications such as sem...
Laura Chiticariu, Vivian Chu, Sajib Dasgupta, Thil...
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
13 years 3 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
SIGMOD
2011
ACM
283views Database» more  SIGMOD 2011»
13 years 3 months ago
iReduct: differential privacy with reduced relative errors
Prior work in differential privacy has produced techniques for answering aggregate queries over sensitive data in a privacypreserving way. These techniques achieve privacy by addi...
Xiaokui Xiao, Gabriel Bender, Michael Hay, Johanne...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
13 years 3 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
13 years 3 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande