15375 search results - page 2826 / 3075 » cans 2008 |
199
click to vote
CJ
2010
15 years 4 months ago
2010
an be used to abstract away from the physical reality by describing it as components that exist in discrete states with probabilistically invoked actions that change the state. The...
171
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
180
click to vote
ENTCS
2011
15 years 1 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
175
click to vote
IJCV
2011
15 years 1 months ago
2011
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
157
click to vote
IJWBC
2011
15 years 1 months ago
2011
Nowadays, we witness a surge of online profiling sites; in them people make their profile available to others with the intention to share it and get in touch with others, find old ...