2137 search results - page 188 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
171
click to vote
ADBIS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
217
click to vote
ICDAR
2011
IEEE
14 years 6 months ago
2011
IEEE
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
187
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
174
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
153
click to vote
APPROX
2007
Springer
16 years 18 days ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...