Sciweavers

5595 search results - page 410 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
KDD
2002
ACM
118views Data Mining» more  KDD 2002»
16 years 7 months ago
SECRET: a scalable linear regression tree algorithm
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
Alin Dobra, Johannes Gehrke
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 8 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
ICDE
2006
IEEE
208views Database» more  ICDE 2006»
16 years 26 days ago
Approximate Video Search Based on Spatio-Temporal Information of Video Objects
The spatio-temporal information of a video object is important for content-based video retrieval. In this paper the spatio-temporal information of a video object, such as the velo...
Chia-Han Lin, Arbee L. P. Chen
ICAI
2009
15 years 4 months ago
On the Construction of Initial Basis Function for Efficient Value Function Approximation
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...
Chung-Cheng Chiu, Kuan-Ta Chen
WG
2004
Springer
16 years 5 days ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern