Sciweavers

2520 search results - page 162 / 504
» The complexity of approximating entropy
Sort
View
91
Voted
COMPGEOM
2010
ACM
15 years 2 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
85
Voted
TOH
2008
98views more  TOH 2008»
14 years 10 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
90
Voted
CORR
2010
Springer
155views Education» more  CORR 2010»
14 years 5 months ago
Exploiting Temporal Complex Network Metrics in Mobile Malware Containment
Malicious mobile phone worms spread between devices via short-range Bluetooth contacts, similar to the propagation of human and other biological viruses. Recent work has employed m...
John Tang, Cecilia Mascolo, Mirco Musolesi, Vito L...
100
Voted
COMPGEOM
2009
ACM
15 years 5 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
92
Voted
INFOCOM
2006
IEEE
15 years 5 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang