Sciweavers

93 search results - page 17 / 19
» A Probabilistic Framework for Correspondence and Egomotion
Sort
View
ICTAI
2009
IEEE
13 years 5 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
AAAI
2011
12 years 8 months ago
Understanding Natural Language Commands for Robotic Navigation and Mobile Manipulation
This paper describes a new model for understanding natural language commands given to autonomous systems that perform navigation and mobile manipulation in semi-structured environ...
Stefanie Tellex, Thomas Kollar, Steven Dickerson, ...
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 8 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
14 years 8 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 7 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin