Sciweavers

2492 search results - page 106 / 499
» On the General Signature Trees
Sort
View
ROBOCUP
2000
Springer
146views Robotics» more  ROBOCUP 2000»
15 years 10 months ago
Observation Strategy for Decision Making Based on Information Criterion
Self localization seems necessary for mobile robot navigation. The conventional method such as geometric reconstruction from landmark observations is generally time-consuming and ...
Noriaki Mitsunaga, Minoru Asada
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 6 months ago
Abstract machines for dialogue games
Machines for Dialogue Games P.-L. Curien (CNRS - Paris 7) H. Herbelin (INRIA-Futurs) July 16, 2005 The notion of abstract B¨ohm tree has arisen as an operationally-oriented disti...
Pierre-Louis Curien, Hugo Herbelin
DM
2002
134views more  DM 2002»
15 years 6 months ago
Covering a hypergraph of subgraphs
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
Noga Alon
TON
2002
144views more  TON 2002»
15 years 6 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
COCOA
2008
Springer
15 years 8 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner