876 search results - page 30 / 176 » Complexity in geometric SINR |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
CAD
2007
Springer
13 years 7 months ago
2007
Springer
We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Alt...
NECO
2000
13 years 7 months ago
2000
We develop geometric dynamical systems methods to determine how various components contribute to a neuronal network's emergent population behavior. The results clarify the mu...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
MOBIHOC
2003
ACM
14 years 7 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...