Sciweavers

1279 search results - page 177 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
DGCI
2005
Springer
14 years 2 months ago
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
AAAI
2007
13 years 11 months ago
Point-Based Policy Iteration
We describe a point-based policy iteration (PBPI) algorithm for infinite-horizon POMDPs. PBPI replaces the exact policy improvement step of Hansen’s policy iteration with point...
Shihao Ji, Ronald Parr, Hui Li, Xuejun Liao, Lawre...
COMPGEOM
2005
ACM
13 years 11 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer
SAC
2005
ACM
14 years 2 months ago
Performance evaluation for text processing of noisy inputs
We investigate the problem of evaluating the performance of text processing algorithms on inputs that contain errors as a result of optical character recognition. A new hierarchic...
Daniel P. Lopresti
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
14 years 3 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...