Sciweavers

1326 search results - page 241 / 266
» Approximate Tree Kernels
Sort
View
107
Voted
VISUALIZATION
1995
IEEE
15 years 6 months ago
Fast Multiresolution Surface Meshing
We present a new method for adaptive surface meshing and triangulationwhichcontrolsthelocallevel–of–detailofthesurface approximation by local spectral estimates. These estimat...
Oliver G. Staadt, Markus H. Gross, Roger Gatti
127
Voted
AAAI
2010
15 years 4 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
113
Voted
IJCAI
2007
15 years 4 months ago
Utile Distinctions for Relational Reinforcement Learning
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
William Dabney, Amy McGovern
119
Voted
AAAI
2004
15 years 4 months ago
PROBCONS: Probabilistic Consistency-Based Multiple Alignment of Amino Acid Sequences
Obtaining an accurate multiple alignment of protein sequences is a difficult computational problem for which many heuristic techniques sacrifice optimality to achieve reasonable r...
Chuong B. Do, Michael Brudno, Serafim Batzoglou
211
Voted
ACID
2006
220views Algorithms» more  ACID 2006»
15 years 4 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove