Sciweavers

552 search results - page 55 / 111
» Constrained Shortest Path Computation
Sort
View
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
15 years 3 months ago
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...
PVLDB
2008
154views more  PVLDB 2008»
14 years 9 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
ICRA
2003
IEEE
146views Robotics» more  ICRA 2003»
15 years 3 months ago
An atlas framework for scalable mapping
Abstract— This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph o...
Michael Bosse, Paul M. Newman, John J. Leonard, Ma...
ICCV
2007
IEEE
15 years 11 months ago
Locally-Constrained Region-Based Methods for DW-MRI Segmentation
In this paper, we describe a method for segmenting fiber bundles from diffusion-weighted magnetic resonance images using a locally-constrained region based approach. From a pre-co...
John Melonakos, Marc Niethammer, Vandana Mohan, Ma...
OSN
2008
83views more  OSN 2008»
14 years 9 months ago
Path selection in user-controlled circuit-switched optical networks
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...
Wojciech M. Golab, Raouf Boutaba