705 search results - page 64 / 141 » Approximating Extended Answer Sets |
114
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
129
click to vote
SODA
1992
ACM
15 years 4 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
163
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
147
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...
144
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-b...