2137 search results - page 408 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
136
Voted
VLDB
2002
ACM
15 years 1 months ago
2002
ACM
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
105
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
This paper addresses the problem of segmenting an image into regions consistent with user-supplied seeds (e.g., a sparse set of broad brush strokes). We view this task as a statis...
120
click to vote
PODS
2005
ACM
16 years 2 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
129
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
With the relentless scaling of semiconductor technology, the lifetime reliability of embedded multiprocessor platforms has become one of the major concerns for the industry. If th...
132
click to vote
GD
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...