359 search results - page 39 / 72 » The Parameterized Complexity of Counting Problems |
81
Voted
ICIP
2006
IEEE
15 years 12 months ago
2006
IEEE
Traditional snakes, or active contours, are planar parametric curves. Their parameters are determined by optimizing the weighted sum of three energy terms: one depending on the dat...
74
Voted
IPL
2007
14 years 10 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
111
Voted
WDAG
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
92
Voted
RTAS
2009
IEEE
15 years 5 months ago
2009
IEEE
Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the a...
65
Voted
ECOOP
2006
Springer
15 years 1 months ago
2006
Springer
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...