5608 search results - page 866 / 1122 » On the Theory of Matchgate Computations |
198
click to vote
SMA
2003
ACM
15 years 12 months ago
2003
ACM
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
158
click to vote
SMA
2003
ACM
15 years 12 months ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
164
click to vote
CIE
2010
Springer
15 years 10 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
191
Voted
AAAI
2007
15 years 9 months ago
2007
Human visual capability has remained largely beyond the reach of engineered systems despite intensive study and considerable progress in problem understanding, algorithms and comp...
193
click to vote
EUSFLAT
2007
15 years 8 months ago
2007
At present time configurable wireless sensor networks are given special consideration. Wireless sensor networks are now a static elements union. To make such a network a powerful ...