1677 search results - page 239 / 336 » On the Completeness of Quantum Computation Models |
129
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
PG
2003
IEEE
15 years 6 months ago
2003
IEEE
A method is proposed in this paper to automatically generate the animation skeleton of a model such that the model can be manipulated according to the skeleton. With our method, u...
129
Voted
IJCV
2007
15 years 1 months ago
2007
The visual effects of rain are complex. Rain produces sharp intensity changes in images and videos that can severely impair the performance of outdoor vision systems. In this paper...
115
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
123
click to vote
IJFCS
2006
15 years 1 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...