Sciweavers

7006 search results - page 171 / 1402
» Approximation Algorithms
Sort
View
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
15 years 6 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
INFOCOM
2010
IEEE
15 years 1 months ago
Approximate Models for General Cache Networks
Abstract—Many systems employ caches to improve performance. While isolated caches have been studied in-depth, multicache systems are not well understood, especially in networks w...
Elisha J. Rosensweig, James F. Kurose, Donald F. T...
COMGEO
2008
ACM
15 years 3 months ago
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
Robert L. Scot Drysdale, Günter Rote, Astrid ...
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 3 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
ATAL
2007
Springer
15 years 9 months ago
Implementing the maximum of monotone algorithms
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
Liad Blumrosen