16666 search results - page 336 / 3334 » Descriptive and Computational Complexity |
209
click to vote
SIGGRAPH
1996
ACM
15 years 11 months ago
1996
ACM
We present a new method that utilizes path coherence to accelerate walkthroughs of geometrically complex static scenes. As a preprocessing step, our method constructs a BSP-tree t...
201
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
160
click to vote
AI
2007
Springer
15 years 6 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...
203
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
176
click to vote
AMC
2007
15 years 6 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...