1952 search results - page 311 / 391 » Complete partitions of graphs |
216
click to vote
VLDB
2001
ACM
16 years 4 months ago
2001
ACM
In this paper, we present an approach to global transactionmanagementinworkflowenvironments.Thetransaction mechanism is based on the well-known notion of compensation, but extended...
124
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
117
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
188
click to vote
LICS
2000
IEEE
15 years 9 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
165
click to vote
SRDS
1993
IEEE
15 years 8 months ago
1993
IEEE
We propose a simple and practical probabilistic comparison-based model, employing multiple incomplete test concepts, for handling fault location in distributed systems using a Bay...