9842 search results - page 1356 / 1969 » The Complexity of the Matching-Cut Problem |
170
click to vote
RTSS
2002
IEEE
16 years 4 days ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
207
click to vote
ESA
2009
Springer
15 years 12 months ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
208
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
184
click to vote
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
179
click to vote
TOOLS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this experience report we present a case study in designing, implementing, and reusing an object-oriented framework for constructing and editing complex search expressions over...