2137 search results - page 129 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
176
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
153
click to vote
FUN
2007
Springer
15 years 9 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
157
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
125
Voted
EURODAC
1994
IEEE
15 years 9 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
153
click to vote
INFORMATICALT
2000
15 years 4 months ago
2000
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...