11160 search results - page 192 / 2232 » Incompleteness in a General Setting |
163
click to vote
ALGORITHMICA
1998
15 years 4 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
141
click to vote
GBRPR
2005
Springer
15 years 9 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
119
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
140
click to vote
KDD
1997
ACM
15 years 8 months ago
1997
ACM
1 Several clustering algorithms have been proposed for class identification in spatial databases such as earth observation databases. The effectivity of the well-known algorithms ...
149
click to vote
AUTOMATICA
2006
15 years 4 months ago
2006
Motivated by questions in stability theory for hybrid dynamical systems, we establish some fundamental properties of the set of solutions to such systems. Using the notion of a hy...