6740 search results - page 449 / 1348 » An s -Hamiltonian Line Graph Problem |
132
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
Vectorization, i.e. raster–to–vector conversion, is a central part of graphics recognition problems. In this paper, we discuss the pros and the cons of basing one’s vectoriz...
174
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
181
click to vote
KR
1991
Springer
15 years 10 months ago
1991
Springer
This paper describes a reasoning system based on a temporal logic that can solve planning problems along the lines of traditional planning systems. Because it is cast as inference...
179
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
178
click to vote
HASE
2008
IEEE
16 years 1 months ago
2008
IEEE
A high assurance system requires both functional and nonfunctional correctness before the system is put into operation. To examine whether a system’s actual performance complies...