3172 search results - page 167 / 635 » On the Random-Self-Reducibility of Complete Sets |
192
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
138
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
157
click to vote
DM
2006
15 years 6 months ago
2006
Assuming that every proper minor closed class of graphs contains a maximum with respect to the homomorphism order, we prove that such a maximum must be homomorphically equivalent ...
146
click to vote
MSOM
2010
15 years 4 months ago
2010
In project management, most manufacturers (project managers) offer no delayed payment contracts under which each supplier (contractor) will receive a pre-specified payment when ...
176
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
In this paper we give a complete characterization of critical configurations for projective reconstruction with any number of points and views. A set of cameras and points is said...