9842 search results - page 308 / 1969 » The Complexity of the Matching-Cut Problem |
125
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract: Protection and surveillance of persons and facilities is frequently associated with automatic tracking of striking objects like vehicles or persons in an image sequence. ...
120
click to vote
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
— Many methods exist for the automatic and optimal 3D reconstruction of camera motion and scene structure from image sequence (’Structure from Motion‘ or SfM). The solution t...
139
click to vote
AAIM
2005
Springer
15 years 9 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
118
click to vote
ISSAC
2005
Springer
15 years 9 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
145
Voted
OTM
2005
Springer
15 years 9 months ago
2005
Springer
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...