194 search results - page 10 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
109
click to vote
ICCV
1999
IEEE
16 years 2 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
129
Voted
CAISE
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
105
click to vote
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
102
click to vote
DAM
1999
15 years 3 days ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
ALDT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...