194 search results - page 15 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
117
Voted
STOC
2004
ACM
16 years 23 days ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
105
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
105
Voted
DAC
1999
ACM
15 years 4 months ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
108
click to vote
ACISICIS
2007
IEEE
15 years 6 months ago
2007
IEEE
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
In this work we propose a hierarchical approach for labeling semantic objects and regions in scenes. Our approach is reminiscent of early vision literature in that we use a decompo...