Sciweavers

5595 search results - page 180 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
DASFAA
2007
IEEE
190views Database» more  DASFAA 2007»
15 years 11 months ago
Clustering Moving Objects in Spatial Networks
Advances in wireless networks and positioning technologies (e.g., GPS) have enabled new data management applications that monitor moving objects. In such new applications, realtime...
Jidong Chen, Caifeng Lai, Xiaofeng Meng, Jianliang...
TIP
2008
168views more  TIP 2008»
15 years 5 months ago
A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
Yonggang Shi, William Clement Karl
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 5 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 5 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
EVOW
1999
Springer
15 years 9 months ago
Approximate Equivalence Verification for Protocol Interface Implementation via Genetic Algorithms
This paper describes a new approximate approach for checking the correctness of the implementation of a protocol interface, comparing its lowlevel implementation with its high-leve...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...