Sciweavers

828 search results - page 150 / 166
» Bounded Hairpin Completion
Sort
View
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 9 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 9 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
OSDI
2008
ACM
14 years 9 months ago
Redline: First Class Support for Interactivity in Commodity Operating Systems
While modern workloads are increasingly interactive and resource-intensive (e.g., graphical user interfaces, browsers, and multimedia players), current operating systems have not ...
Ting Yang, Tongping Liu, Emery D. Berger, Scott F....
SIGMOD
2007
ACM
124views Database» more  SIGMOD 2007»
14 years 8 months ago
Query suspend and resume
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...
Badrish Chandramouli, Christopher N. Bond, Shivnat...
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 8 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee