Sciweavers

2152 search results - page 412 / 431
» A Comparative Study of 2QBF Algorithms
Sort
View
162
Voted
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 4 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
128
Voted
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
16 years 4 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
207
Voted
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 4 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 4 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
111
Voted
ICSE
2005
IEEE-ACM
16 years 4 months ago
Efficient and precise dynamic impact analysis using execute-after sequences
As software evolves, impact analysis estimates the potential effects of changes, before or after they are made, by identifying which parts of the software may be affected by such ...
Taweesup Apiwattanapong, Alessandro Orso, Mary Jea...