Sciweavers

1172 search results - page 68 / 235
» Approximate Reasoning Based on Similarity
Sort
View
AAAI
2006
13 years 10 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
EWCBR
2004
Springer
14 years 2 months ago
Case Retrieval Using Nonlinear Feature-Space Transformation
Abstract. Good similarity functions are at the heart of effective case-based reasoning. However, the similarity functions that have been designed so far have been mostly linear, we...
Rong Pan, Qiang Yang, Lei Li
TIT
2002
65views more  TIT 2002»
13 years 8 months ago
On the importance of combining wavelet-based nonlinear approximation with coding strategies
This paper provides a mathematical analysis of transform compression in its relationship to linear and nonlinear approximation theory. Contrasting linear and nonlinear approximatio...
Albert Cohen, Ingrid Daubechies, Onur G. Guleryuz,...
AAAI
2007
13 years 11 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas
ENTCS
2007
85views more  ENTCS 2007»
13 years 9 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch