2137 search results - page 268 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
198
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
151
click to vote
ICCSA
2010
Springer
16 years 1 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
160
click to vote
IICS
2003
Springer
15 years 11 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
189
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...
176
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...