428 search results - page 37 / 86 » Completeness of a Fact Extractor |
IJCV
2000
14 years 11 months ago
2000
We address the structure-from-motionproblem in the context of head modeling from video sequences for which calibration data is not available. This task is made challenging by the ...
120
click to vote
JAC
2008
15 years 1 months ago
2008
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
102
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
WINE
2005
Springer
15 years 5 months ago
2005
Springer
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...