16666 search results - page 337 / 3334 » Descriptive and Computational Complexity |
160
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
220
click to vote
CVPR
2009
IEEE
17 years 1 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...
194
click to vote
FOCS
2006
IEEE
16 years 24 days 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...
160
click to vote
SIGGRAPH
1997
ACM
15 years 11 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...
190
Voted
SIGGRAPH
1993
ACM
15 years 10 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...