Sciweavers

3913 search results - page 278 / 783
» complexity 2006
Sort
View
149
Voted
SI3D
2006
ACM
16 years 4 days ago
Fast scene voxelization and applications
This paper presents a novel approach that uses graphics hardware to dynamically calculate a voxel-based representation of a scene. The voxelization is obtained on run-time in the ...
Elmar Eisemann, Xavier Décoret
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
16 years 4 days ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang
ACSD
2006
IEEE
76views Hardware» more  ACSD 2006»
15 years 10 months ago
Specification and Verification of Dynamic Communication Systems
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing...
Jörg Bauer, Ina Schaefer, Tobe Toben, Bernd W...
APNOMS
2006
Springer
15 years 10 months ago
Hybrid Inference Architecture and Model for Self-healing System
Distributed computing systems are continuously increasing in complexity and cost of managing, and system management tasks require significantly higher levels of autonomic managemen...
Giljong Yoo, Jeongmin Park, Eunseok Lee
ASPDAC
2006
ACM
123views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Efficient static timing analysis using a unified framework for false paths and multi-cycle paths
- We propose a framework to unify the process of false paths and multi-cycle paths in static timing analysis (STA). We use subgraphs attached with timing constraints to represent f...
Shuo Zhou, Bo Yao, Hongyu Chen, Yi Zhu, Chung-Kuan...