Sciweavers

2989 search results - page 496 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
NIPS
2007
15 years 3 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
AIPS
2006
15 years 3 months ago
Reusing and Building a Policy Library
Policy Reuse is a method to improve reinforcement learning with the ability to solve multiple tasks by building upon past problem solving experience, as accumulated in a Policy Li...
Fernando Fernández, Manuela M. Veloso
JAIR
2006
160views more  JAIR 2006»
15 years 2 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
IVS
2007
140views more  IVS 2007»
15 years 2 months ago
Fast point-feature label placement for dynamic visualizations
This paper describes a fast approach to automatic point label de-confliction on interactive maps. The general Map Labeling problem is NP-hard and has been the subject of much stud...
Kevin Mote
JVCA
2007
93views more  JVCA 2007»
15 years 2 months ago
Gradient-based shell generation and deformation
Shell becomes popular in a variety of modeling techniques for representing small-scale features and increasing visual complexity. Current shell generation algorithms do not measur...
Jin Huang, Xinguo Liu, Haiyang Jiang, Qing Wang, H...