Sciweavers

132 search results - page 21 / 27
» Mapping Validation by Probabilistic Reasoning
Sort
View
JCST
2010
189views more  JCST 2010»
13 years 2 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
IJSWIS
2007
171views more  IJSWIS 2007»
13 years 7 months ago
Experience in Aligning Anatomical Ontologies
An ontology is a formal representation of a domain modeling the entities in the domain and their relations. When a domain is represented by multiple ontologies, there is need for ...
Songmao Zhang, Olivier Bodenreider
HRI
2010
ACM
14 years 2 months ago
Toward understanding natural language directions
—Speaking using unconstrained natural language is an intuitive and flexible way for humans to interact with robots. Understanding this kind of linguistic input is challenging be...
Thomas Kollar, Stefanie Tellex, Deb Roy, Nicholas ...
ATAL
2008
Springer
13 years 9 months ago
Coordination in ambiguity: coordinated active localization for multiple robots
In environments which possess relatively few features that enable a robot to unambiguously determine its location, global localization algorithms can result in multiple hypotheses...
Shivudu Bhuvanagiri, K. Madhava Krishna, Supreeth ...
AI
2011
Springer
12 years 11 months ago
Parallelizing a Convergent Approximate Inference Method
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
Ming Su, Elizabeth Thompson