Sciweavers

1381 search results - page 87 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
SI3D
2003
ACM
15 years 9 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
ICIP
2000
IEEE
16 years 5 months ago
Rate-Complexity-Distortion Optimization for Quadtree-Based DCT Coding
In this paper, we study rate-complexity-distortion (R-C-D) tradeoffs for video coding, where we focus on the complexity of computing the inverse DCT. A quadtree coding approach is...
Krisda Lengwehasatit, Antonio Ortega
125
Voted
SIGGRAPH
2010
ACM
15 years 8 months ago
Volume contact constraints at arbitrary resolution
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
Jérémie Allard, François Faure, Hadrien Courtec...
ICCNMC
2005
Springer
15 years 9 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
ECBS
1999
IEEE
112views Hardware» more  ECBS 1999»
15 years 8 months ago
Metaprogrammable Toolkit for Model-Integrated Computing
Model-Integrated Computing, specifically Model-Integrated Program Synthesis (MIPS) environments that include visual model building, constraint management, and automatic program sy...
Ákos Lédeczi, Miklos Maroti, Gabor K...