Sciweavers

1421 search results - page 107 / 285
» Satisfying KBO Constraints
Sort
View
UAI
2008
13 years 9 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht
VIP
2003
13 years 9 months ago
3D Reconstruction of Single Picture
This paper presents a novel approach for creating curvilinear, texture mapped, 3D scene models from a single painting or photograph with no prior internal knowledge about the shap...
Zhao Ting, David Dagan Feng, Tan Zheng
JCP
2008
104views more  JCP 2008»
13 years 8 months ago
Discovery of Sequential Patterns Coinciding with Analysts' Interests
This paper proposes a new sequential pattern mining method. The method introduces a new evaluation criterion satisfying the Apriori property. The criterion is calculated by the fre...
Shigeaki Sakurai, Youichi Kitahara, Ryohei Orihara...
COMPUTING
2004
115views more  COMPUTING 2004»
13 years 8 months ago
Length Preserving Multiresolution Editing of Curves
In this paper a method for multiresolution deformation of planar piecewise linear curves that preserves the curve length is presented. In a wavelet based multiresolution editing f...
Basile Sauvage, Stefanie Hahmann, Georges-Pierre B...
TON
2002
99views more  TON 2002»
13 years 8 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda