Sciweavers

1056 search results - page 150 / 212
» Constraint-Based Graph Matching
Sort
View
ICPR
2010
IEEE
14 years 4 months ago
Motion-Sketch Based Video Retrieval Using a Trellis Levenshtein Distance
We present a fast technique for retrieving video clips using free-hand sketched queries. Visual keypoints within each video are detected and tracked to form short trajectories, wh...
Rui Hu, John Philip Collomosse
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
14 years 2 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj
DAM
2002
82views more  DAM 2002»
13 years 8 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
ENDM
2010
103views more  ENDM 2010»
13 years 6 months ago
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
Mathieu Lacroix, Ali Ridha Mahjoub, Sébasti...
ICCV
1998
IEEE
14 years 11 months ago
Representation and Self-Similarity of Shapes
Representing shapes is a signi cant problem for vision systems that must recognize or classify objects. We derive a representation for a given shape by investigating its self-simi...
Tyng-Luh Liu, Davi Geiger, Robert Kohn