Sciweavers

5595 search results - page 70 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
IJCAI
2001
15 years 6 months ago
An Improved Grid-Based Approximation Algorithm for POMDPs
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
Rong Zhou, Eric A. Hansen
EMNLP
2007
15 years 6 months ago
V-Measure: A Conditional Entropy-Based External Cluster Evaluation Measure
We present V-measure, an external entropybased cluster evaluation measure. Vmeasure provides an elegant solution to many problems that affect previously defined cluster evaluatio...
Andrew Rosenberg, Julia Hirschberg
UAI
2001
15 years 6 months ago
A Clustering Approach to Solving Large Stochastic Matching Problems
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
Milos Hauskrecht, Eli Upfal
148
Voted
CGF
2008
121views more  CGF 2008»
15 years 4 months ago
Tensor Clustering for Rendering Many-Light Animations
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
Milos Hasan, Edgar Velázquez-Armendá...
CLUSTER
2006
IEEE
15 years 10 months ago
A Parallel Algorithm for the Solution of the Deconvolution Problem on Heterogeneous Networks
In this work we present a parallel algorithm for the solution of a least squares problem with structured matrices. This problem arises in many applications mainly related to digit...
Pedro Alonso, Antonio M. Vidal, Alexey L. Lastovet...