Sciweavers

2698 search results - page 315 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
IPL
2007
76views more  IPL 2007»
15 years 6 months ago
Minimum cost subpartitions in graphs
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
Hiroshi Nagamochi, Yoko Kamidoi
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 7 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
ECCV
2010
Springer
15 years 12 months ago
Maximum Margin Distance Learning for Dynamic Texture Recognition
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
IVC
2007
102views more  IVC 2007»
15 years 6 months ago
Analysis of the rubberband algorithm
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
ICCV
2001
IEEE
16 years 8 months ago
3D Object Tracking Using Shape-Encoded Particle Propagation
We present a comprehensive treatment of 3D object tracking by posing it as a nonlinear state estimation problem. The measurements are derived using the outputs of shape-encoded fi...
Hankyu Moon, Rama Chellappa, Azriel Rosenfeld