3172 search results - page 16 / 635 » On the Random-Self-Reducibility of Complete Sets |
100
click to vote
JPDC
2000
15 years 14 days ago
2000
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
99
Voted
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
Set expansion refers to expanding a given partial set of objects into a more complete set. A well-known example system that does set expansion using the web is Google Sets. In thi...
103
Voted
ECAL
2007
Springer
15 years 6 months ago
2007
Springer
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
82
Voted
AIIA
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
105
Voted
ICIP
2004
IEEE
16 years 2 months ago
2004
IEEE
We address the automatic recovery of complete 3-D object models from video streams. Usually, complete 3-D models are built by fusing several depth maps, each computed from a small...