Sciweavers

5624 search results - page 793 / 1125
» On Conditional Covering Problem
Sort
View
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 5 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
VLDB
2003
ACM
141views Database» more  VLDB 2003»
16 years 4 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
VLDB
2007
ACM
169views Database» more  VLDB 2007»
16 years 4 months ago
Staying FIT: Efficient Load Shedding Techniques for Distributed Stream Processing
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due t...
Nesime Tatbul, Stanley B. Zdonik, Ugur Çeti...
SIGMOD
2008
ACM
65views Database» more  SIGMOD 2008»
16 years 4 months ago
Generating targeted queries for database testing
Tools for generating test queries for databases do not explicitly take into account the actual data in the database. As a consequence, such tools cannot guarantee suitable coverag...
Chaitanya Mishra, Nick Koudas, Calisto Zuzarte
EDBT
2008
ACM
166views Database» more  EDBT 2008»
16 years 4 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu