3172 search results - page 55 / 635 » On the Random-Self-Reducibility of Complete Sets |
98
Voted
JCO
2007
15 years 18 days ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
114
click to vote
APLAS
2007
ACM
15 years 4 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
121
click to vote
ICTL
1994
15 years 4 months ago
1994
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
ESWS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Aiming to build a complete benchmark for better evaluation of existing ontology systems, we extend the well-known Lehigh University Benchmark in terms of inference and sc...
124
Voted
DICTA
2007
15 years 2 months ago
2007
A common problem when using automated structure from motion techniques is that the object to be modelled can only be partially reconstructed from the video. This can occur because...