Sciweavers

707 search results - page 102 / 142
» Solving path problems on the GPU
Sort
View
CVPR
2006
IEEE
16 years 1 months ago
Multi-Target Tracking - Linking Identities using Bayesian Network Inference
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
Peter Nillius, Josephine Sullivan, Stefan Carlsson
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
15 years 5 months ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
14 years 11 months ago
Exploring Unknown Environments with Obstacles
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
Susanne Albers, Klaus Kursawe, Sven Schuierer
SSD
2007
Springer
132views Database» more  SSD 2007»
15 years 6 months ago
Computing a k -Route over Uncertain Geographical Data
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sa...
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 1 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...