Sciweavers

4797 search results - page 97 / 960
» The complexity of partition tasks
Sort
View
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
14 years 2 months ago
The Linear-Array Conjecture in Communication Complexity is False
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...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 10 months ago
Multiple resolution of the modular structure of complex networks
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...
Alex Arenas, Alberto Fernández, Sergio G&oa...
MICCAI
2004
Springer
14 years 11 months ago
Construction of 3D Dynamic Statistical Deformable Models for Complex Topological Shapes
Abstract. This paper describes the construction of 3D dynamic statistical deformable models for complex topological shapes. It significantly extents the existing framework in that ...
Paramate Horkaew, Guang-Zhong Yang
VISUALIZATION
2003
IEEE
14 years 3 months ago
Interactive View-Dependent Rendering with Conservative Occlusion Culling in Complex Environments
This paper presents a novel algorithm combining view-dependent rendering and conservative occlusion culling for interactive display of complex environments. A vertex hierarchy of ...
Sung-Eui Yoon, Brian Salomon, Dinesh Manocha
SIGGRAPH
1996
ACM
14 years 2 months ago
Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments
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...
Jonathan Shade, Dani Lischinski, David Salesin, To...