3172 search results - page 16 / 635 » On the Random-Self-Reducibility of Complete Sets |
187
click to vote
JPDC
2000
15 years 6 months 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...
166
click to vote
ICDM
2007
IEEE
16 years 29 days 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...
177
click to vote
ECAL
2007
Springer
16 years 25 days 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...
153
click to vote
AIIA
2003
Springer
15 years 12 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 ...
194
click to vote
ICIP
2004
IEEE
16 years 8 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...