Sciweavers

1756 search results - page 174 / 352
» Directed scale-free graphs
Sort
View
EJC
2011
13 years 3 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
KI
2010
Springer
13 years 3 months ago
Lifelong Map Learning for Graph-based SLAM in Static Environments
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
Henrik Kretzschmar, Giorgio Grisetti, Cyrill Stach...
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 3 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
IPPS
2010
IEEE
13 years 6 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke