Sciweavers

2957 search results - page 272 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
CCR
2006
122views more  CCR 2006»
15 years 6 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
CPHYSICS
2006
103views more  CPHYSICS 2006»
15 years 6 months ago
WATERWAVES: wave particles dynamics on a complex triatomic potential
The WATERWAVES program suite performs complex scattering calculations by propagating a wave packet in a complex, full-dimensional potential for non-rotating (J = 0) but vibrating ...
Simone Taioli, Jonathan Tennyson
COCO
1995
Springer
113views Algorithms» more  COCO 1995»
15 years 10 months ago
On the Structure of Low Sets
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
Johannes Köbler
COMPGEOM
2010
ACM
15 years 10 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
TOH
2008
98views more  TOH 2008»
15 years 6 months ago
Six-DoF Haptic Rendering of Contact Between Geometrically Complex Reduced Deformable Models
Real-time evaluation of distributed contact forces between rigid or deformable 3D objects is a key ingredient of 6-DoF force-feedback rendering. Unfortunately, at very high tempora...
Jernej Barbic, Doug L. James