648 search results - page 85 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
COMGEO
2006
ACM
13 years 9 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
ICTAI
2007
IEEE
14 years 3 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
ICITA
2005
IEEE
14 years 2 months ago
2005
IEEE
— A novel algorithm for construct a seamless video mosaic of the entire panorama continuously by automatically analyzing and managing feature points, including management of quan...
CVPR
2001
IEEE
14 years 11 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
PAKDD
2007
ACM
14 years 3 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...