194 search results - page 17 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
111
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
177
click to vote
VLDB
2007
ACM
16 years 21 days ago
2007
ACM
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
132
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
90
Voted
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
We propose an information-theoretic method for multi-phase image segmentation, in an active contour-based framework. Our approach is based on nonparametric density estimates, and ...