15033 search results - page 212 / 3007 » Complexity Theory and Algorithms |
148
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
120
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
152
click to vote
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
A novel feature extraction method, namely monogenic binary pattern (MBP), is proposed in this paper based on the theory of monogenic signal analysis, and the histogram of MBP (HMB...
137
click to vote
ICDCS
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
165
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...