13603 search results - page 193 / 2721 » On the Complexity of Computing Treelength |
126
click to vote
AI
2007
Springer
15 years 4 months ago
2007
Springer
Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preferen...
143
click to vote
AMC
2007
15 years 4 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
170
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...
154
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...
120
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...