Sciweavers

4860 search results - page 592 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 7 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
134
Voted
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 9 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
147
Voted
IPPS
2006
IEEE
15 years 11 months ago
Battery-aware router scheduling in wireless mesh networks
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
Chi Ma, Zhenghao Zhang, Yuanyuan Yang
188
Voted
RTAS
2003
IEEE
15 years 10 months ago
An Integrated Approach for Applying Dynamic Voltage Scaling to Hard Real-Time Systems
Wireless and portable devices depend on the limited power supplied by the battery. Dynamic Voltage Scaling (DVS) is an effective method to reduce CPU power consumption. For real-t...
Yanbin Liu, Aloysius K. Mok
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 19 hour ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...