Sciweavers

7930 search results - page 1351 / 1586
» Greedy in Approximation Algorithms
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 5 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
16 years 5 months ago
Suppressing model overfitting in mining concept-drifting data streams
Mining data streams of changing class distributions is important for real-time business decision support. The stream classifier must evolve to reflect the current class distributi...
Haixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jef...
RECOMB
2006
Springer
16 years 5 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 5 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
PODS
2005
ACM
211views Database» more  PODS 2005»
16 years 4 months ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
« Prev « First page 1351 / 1586 Last » Next »