Sciweavers

2157 search results - page 373 / 432
» Optimal Fast Hashing
Sort
View
ADHOC
2008
183views more  ADHOC 2008»
14 years 12 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
CCE
2008
14 years 12 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
DC
2010
14 years 12 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
CORR
2008
Springer
234views Education» more  CORR 2008»
14 years 12 months ago
Bayesian Compressive Sensing via Belief Propagation
Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-N...
Dror Baron, Shriram Sarvotham, Richard G. Baraniuk
FUIN
2008
80views more  FUIN 2008»
14 years 12 months ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...