Sciweavers

1048 search results - page 140 / 210
» Best Probabilistic Transformers
Sort
View
JCT
2002
107views more  JCT 2002»
15 years 5 months ago
Asymmetric Binary Covering Codes
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
RAS
2008
84views more  RAS 2008»
15 years 5 months ago
Monitoring the execution of robot plans using semantic knowledge
Even the best laid plans can fail, and robot plans executed in real world domains tend to do so often. The ability of a robot to reliably monitor the execution of plans and detect...
Abdelbaki Bouguerra, Lars Karlsson, Alessandro Saf...
CIKM
2010
Springer
15 years 4 months ago
Ranking under temporal constraints
This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specifi...
Lidan Wang, Donald Metzler, Jimmy Lin
RAS
2008
136views more  RAS 2008»
15 years 4 months ago
Action evaluation for mobile robot global localization in cooperative environments
This work is about solving the global localization issue for mobile robots operating in large and cooperative environments. It tackles the problem of estimating the pose of a robo...
Andreu Corominas Murtra, Josep Maria Mirats i Tur,...
PVLDB
2010
158views more  PVLDB 2010»
15 years 4 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb