Sciweavers

1161 search results - page 98 / 233
» Approximation schemes for clustering problems
Sort
View
137
Voted
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 9 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
125
Voted
SIAMMAX
2010
116views more  SIAMMAX 2010»
14 years 10 months ago
Acquired Clustering Properties and Solution of Certain Saddle Point Systems
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...
M. A. Olshanskii, V. Simoncini
ECML
2006
Springer
15 years 7 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
218
Voted
ACID
2006
220views Algorithms» more  ACID 2006»
15 years 5 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
113
Voted
SPIRE
2005
Springer
15 years 9 months ago
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
Heikki Hyyrö