16404 search results - page 882 / 3281 » A set coverage problem |
204
click to vote
ICALP
2010
Springer
16 years 13 days ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
186
click to vote
ECCV
2010
Springer
16 years 22 min ago
2010
Springer
Abstract. Structure-from-motion (SfM) is an important computer vision problem and largely relies on the quality of feature tracking. In image sequences, if disjointed tracks caused...
200
click to vote
HYBRID
1999
Springer
15 years 12 months ago
1999
Springer
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...
211
click to vote
EPS
1998
Springer
15 years 12 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
213
click to vote
ESORICS
1998
Springer
15 years 12 months ago
1998
Springer
When implementing a multilevel security policy for Object-Oriented Databases (OODBs), several aspects have to be investigated. One of these aspect is the design of multilevel OODB...