Sciweavers

2796 search results - page 363 / 560
» The coolest path problem
Sort
View
PLDI
2006
ACM
16 years 14 days ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
SPAA
2006
ACM
16 years 14 days ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
ICRA
2005
IEEE
116views Robotics» more  ICRA 2005»
16 years 3 days ago
Using Hierarchical EM to Extract Planes from 3D Range Scans
— Recently, the acquisition of three-dimensional maps has become more and more popular. This is motivated by the fact that robots act in the three-dimensional world and several t...
Rudolph Triebel, Wolfram Burgard, Frank Dellaert
PODC
2005
ACM
16 years 2 days ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
SPAA
2005
ACM
16 years 2 days ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...