Sciweavers

3270 search results - page 445 / 654
» Approximate String Processing
Sort
View
AIPS
2009
13 years 12 months ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
BMCBI
2007
237views more  BMCBI 2007»
13 years 11 months ago
FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data
Background: Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing cluster...
Limin Fu, Enzo Medico
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 10 months ago
A Unified View of TD Algorithms; Introducing Full-Gradient TD and Equi-Gradient Descent TD
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
Manuel Loth, Philippe Preux
JMLR
2006
124views more  JMLR 2006»
13 years 10 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 8 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...