Sciweavers

1274 search results - page 54 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
GLOBECOM
2008
IEEE
14 years 4 months ago
Robust Distributed Sensor Network Localization Based on Analysis of Flip Ambiguities
Abstract— A major problem in wireless sensor network localization is erroneous local geometric realizations in some parts of the network due to the sensitivity to certain distanc...
Anushiya A. Kannan, Baris Fidan, Guoqiang Mao
COMPGEOM
1999
ACM
14 years 2 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
COMPGEOM
2011
ACM
13 years 1 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
ICCSA
2007
Springer
14 years 4 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
DATE
2003
IEEE
75views Hardware» more  DATE 2003»
14 years 3 months ago
Circuit and Platform Design Challenges in Technologies beyond 90nm
There are already a huge number of problems for silicon designers and it is likely to just get worse. Many of these problems are technical associated with shrinking geometries and...
Bill Grundmann, Rajesh Galivanche, Sandip Kundu