Sciweavers

4843 search results - page 316 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
118
Voted
AAAI
2006
15 years 5 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
JCO
2010
169views more  JCO 2010»
15 years 2 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
139
Voted
SIAMIS
2011
14 years 11 months ago
An Upwind Finite-Difference Method for Total Variation-Based Image Smoothing
In this paper we study finite-difference approximations to the variational problem using the BV smoothness penalty that was introduced in an image smoothing context by Rudin, Osh...
Antonin Chambolle, Stacey Levine, Bradley J. Lucie...
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
16 years 5 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 5 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...