Sciweavers

24 search results - page 5 / 5
» What makes some POMDP problems easy to approximate
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 5 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
DAGM
2003
Springer
13 years 10 months ago
Splines and Wavelets: New Perspectives for Pattern Recognition
We provide an overview of spline and wavelet techniques with an emphasis on applications in pattern recognition. The presentation is divided in three parts. In the first one, we ar...
Michael Unser
IROS
2006
IEEE
202views Robotics» more  IROS 2006»
13 years 11 months ago
Topological characterization of mobile robot behavior
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
Aurélien Hazan, Frédéric Dave...
ICDE
2011
IEEE
194views Database» more  ICDE 2011»
12 years 8 months ago
Representative skylines using threshold-based preference distributions
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, R...