2272 search results - page 62 / 455 » Capture Complexity by Partition |
STOC
1996
ACM
15 years 1 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
101
click to vote
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Modular structure is ubiquitous in real-world complex networks. The detection of this type of organization into modules gives insights in the relationship between topological stru...
100
click to vote
VISUALIZATION
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper presents a novel algorithm combining view-dependent rendering and conservative occlusion culling for interactive display of complex environments. A vertex hierarchy of ...
SIGGRAPH
1996
ACM
15 years 1 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...
CHI
2008
ACM
15 years 10 months ago
2008
ACM
Coarse-grained approaches to customization allow the user to enable or disable groups of features at once, rather than individual features. While this may reduce the complexity of...