3946 search results - page 184 / 790 » The computational complexity of choice sets |
256
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents an interesting observation that epipolar geometry and log–polar transform can be naturally combined by setting the center of the log–polar transform into t...
154
click to vote
DSN
2004
IEEE
15 years 10 months ago
2004
IEEE
Cyclic Redundancy Codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly le...
192
click to vote
ISRR
2001
Springer
15 years 11 months ago
2001
Springer
We discuss the role of spatial representations and visual geometries in vision-based navigation. To a large extent, these choices determine the complexity and robustness of a given...
140
click to vote
IVA
2010
Springer
15 years 5 months ago
2010
Springer
We describe a new organization for virtual human responses to dynamically occurring events. In our approach behavioral responses are enumerated in the representation of the event i...
166
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...