9842 search results - page 1697 / 1969 » The Complexity of the Matching-Cut Problem |
132
click to vote
LPNMR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
197
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
152
click to vote
ICDCS
1999
IEEE
15 years 8 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
129
click to vote
CIKM
1999
Springer
15 years 8 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
164
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
Developing effective content recognition methods for diverse imagery continues to challenge computer vision researchers. We present a new approach for document image content catego...