Sciweavers

1964 search results - page 230 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 8 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier
AAAI
2004
13 years 9 months ago
Stochastic Local Search for POMDP Controllers
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
Darius Braziunas, Craig Boutilier
EOR
2008
200views more  EOR 2008»
13 years 8 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
CVPR
2012
IEEE
11 years 10 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...
WWW
2005
ACM
14 years 9 months ago
Web data extraction based on partial tree alignment
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
Yanhong Zhai, Bing Liu