166 search results - page 22 / 34 » Complexity of Some Geometric and Topological Problems |
PIMRC
2008
IEEE
14 years 3 months ago
2008
IEEE
—In this paper the Self-Localization problem for Sensor Networks is addressed. Given a set of nodes deployed in an environment, self-localization consists of finding out the loc...
COMPGEOM
2001
ACM
14 years 8 days ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
ASPDAC
2004
ACM
14 years 2 months ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
AGTIVE
2003
Springer
14 years 1 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...