14699 search results - page 280 / 2940 » Complexity and Cognitive Computing |
125
click to vote
CCCG
2009
15 years 2 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
167
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
We describe a novel and robust feature descriptor called ordinal spatial intensity distribution (OSID) which is invariant to any monotonically increasing brightness changes. Many t...
152
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
119
click to vote
SIGGRAPH
1997
ACM
15 years 8 months ago
1997
ACM
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
145
click to vote
SIGGRAPH
1993
ACM
15 years 8 months ago
1993
ACM
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model rep...