Sciweavers

173 search results - page 20 / 35
» The Fastest and Shortest Algorithm for All Well-Defined Prob...
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
Topology Control for Simple Mobile Networks
— Topology control is the problem of assigning power levels to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumptio...
Liang Zhao, Errol L. Lloyd, S. S. Ravi
JVCA
2006
140views more  JVCA 2006»
13 years 7 months ago
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...
Oren Tropp, Ayellet Tal, Ilan Shimshoni
VMV
2001
91views Visualization» more  VMV 2001»
13 years 9 months ago
A Robust Procedure to Eliminate Degenerate Faces from Triangle Meshes
When using triangle meshes in numerical simulations or other sophisticated downstream applications, we have to guarantee that no degenerate faces are present since they have, e.g....
Mario Botsch, Leif Kobbelt
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
Robert Hildebrand, Matthias Köppe
ASPDAC
2005
ACM
114views Hardware» more  ASPDAC 2005»
13 years 9 months ago
Redundant-via enhanced maze routing for yield improvement
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...
Gang Xu, Li-Da Huang, David Z. Pan, Martin D. F. W...