Sciweavers

3894 search results - page 524 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
DGCI
2005
Springer
15 years 9 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
ICRA
2003
IEEE
210views Robotics» more  ICRA 2003»
15 years 9 months ago
A truncated least squares approach to the detection of specular highlights in color images
— One of the most difficult aspects of dealing with illumination effects in computer vision is accounting for specularity in the images of real objects. The specular regions in ...
Jae Byung Park, Avinash C. Kak
AGENTS
2001
Springer
15 years 8 months ago
Using background knowledge to speed reinforcement learning in physical agents
This paper describes Icarus, an agent architecture that embeds a hierarchical reinforcement learning algorithm within a language for specifying agent behavior. An Icarus program e...
Daniel G. Shapiro, Pat Langley, Ross D. Shachter
AAAI
2007
15 years 6 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
15 years 6 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