Sciweavers

253 search results - page 11 / 51
» Algorithms for the Approximate Common Divisor Problem
Sort
View
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
14 years 11 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
91
Voted
CDC
2008
IEEE
206views Control Systems» more  CDC 2008»
15 years 4 months ago
Approximate dynamic programming using support vector regression
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
Brett Bethke, Jonathan P. How, Asuman E. Ozdaglar
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
15 years 4 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
IQIS
2005
ACM
15 years 3 months ago
Effective and scalable solutions for mixed and split citation problems in digital libraries
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem...
Dongwon Lee, Byung-Won On, Jaewoo Kang, Sanghyun P...
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
15 years 3 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount