Sciweavers

315 search results - page 20 / 63
» Shortest path optimization under limited information
Sort
View
ISCAPDCS
2001
13 years 9 months ago
Optimal Broadcasting in Injured Hypercubes Using Directed Safety Levels
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hyper...
Jie Wu
EXPDB
2006
ACM
14 years 1 months ago
Pushing XPath Accelerator to its Limits
Two competing encoding concepts are known to scale well with growing amounts of XML data: XPath Accelerator encoding implemented by MonetDB for in-memory documents and X-Hive’s ...
Christian Grün, Alexander Holupirek, Marc Kra...
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 5 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
EMMCVPR
2003
Springer
14 years 1 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
MEDIAFORENSICS
2010
13 years 6 months ago
On the embedding capacity of DNA strands under substitution, insertion, and deletion mutations
A number of methods have been proposed over the last decade for embedding information within deoxyribonucleic acid (DNA). Since a DNA sequence is conceptually equivalent to a unid...
Félix Balado