2695 search results - page 436 / 539 » Learning Graph Matching |
146
click to vote
FCT
2005
Springer
15 years 8 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
120
click to vote
SC
2004
ACM
15 years 7 months ago
2004
ACM
Virtual machines provide flexible, powerful execution environments for Grid computing, offering isolation and security mechanisms complementary to operating systems, customization...
121
click to vote
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
150
click to vote
CODES
2003
IEEE
15 years 7 months ago
2003
IEEE
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...
COCOON
2001
Springer
15 years 7 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...