995 search results - page 133 / 199 » complexity 2011 |
150
Voted
TDSC
2011
14 years 10 months ago
2011
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
204
click to vote
CISS
2011
IEEE
14 years 7 months ago
2011
IEEE
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...
131
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design...
150
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
129
Voted
FGR
2011
IEEE
14 years 7 months ago
2011
IEEE
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...