Sciweavers

580 search results - page 109 / 116
» Choosing a random peer
Sort
View
ICDE
2007
IEEE
155views Database» more  ICDE 2007»
14 years 1 months ago
Query-Aware Sampling for Data Streams
Data Stream Management Systems are useful when large volumes of data need to be processed in real time. Examples include monitoring network traffic, monitoring financial transacti...
Theodore Johnson, S. Muthukrishnan, Vladislav Shka...
COLT
2007
Springer
14 years 1 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
EVOW
2007
Springer
14 years 1 months ago
Overcompressing JPEG Images with Evolution Algorithms
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
Jacques Lévy Véhel, Franklin Mendivi...
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetic algorithms for large join query optimization
Genetic algorithms (GAs) have long been used for large join query optimization (LJQO). Previous work takes all queries as based on one granularity to optimize GAs and compares the...
Hongbin Dong, Yiwen Liang
IEEECIT
2006
IEEE
14 years 1 months ago
Improving Resiliency of Network Topology with Enhanced Evolving Strategies
— Recent studies have shown that many real networks follow the power-law distribution of node degrees. Instead of random connectivity, however, power-law connectivity suffers fro...
Soo Kim, Heejo Lee, Wan Yeon Lee