Sciweavers

2434 search results - page 305 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ADBIS
2009
Springer
140views Database» more  ADBIS 2009»
15 years 10 months ago
Optimizing Maintenance of Constraint-Based Database Caches
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
Joachim Klein 0002, Susanne Braun
PIMRC
2008
IEEE
15 years 10 months ago
Constrained opportunistic power control in wireless networks
— In the opportunistic power control algorithm (OPC), designed in [1], [2], each user tries to keep the product of its transmit power and its experienced effective interference t...
Mehdi Rasti, Ahmad R. Sharafat
BIOINFORMATICS
2007
123views more  BIOINFORMATICS 2007»
15 years 3 months ago
A comparative genome approach to marker ordering
Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The in...
Thomas Faraut, Simon de Givry, Patrick Chabrier, T...
MDM
2004
Springer
133views Communications» more  MDM 2004»
15 years 9 months ago
Cache-Miss-Initiated Prefetch in Mobile Environments
Prefetching has been widely used to improve system performance in mobile environments. Since prefetching consumes system resources, such as bandwidth and power, it is important to...
Hui Song, Guohong Cao
KAIS
2008
114views more  KAIS 2008»
15 years 3 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong