10988 search results - page 540 / 2198 » Algorithmic Folding Complexity |
211
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
209
click to vote
SECURWARE
2008
IEEE
16 years 1 months ago
2008
IEEE
Filtering is a very important issue in next generation networks. These networks consist of a relatively high number of resource constrained devices with very special features, suc...
218
Voted
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many app...
178
click to vote
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
183
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented leve...