Sciweavers

4131 search results - page 23 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 7 days ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
SCHEDULING
2010
116views more  SCHEDULING 2010»
15 years 8 days ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
IJCV
1998
121views more  IJCV 1998»
15 years 1 months ago
Generalization to Novel Views: Universal, Class-based, and Model-based Processing
A major problem in object recognition is that a novel image of a given object can be different from all previously seen images. Images can vary considerably due to changes in viewi...
Yael Moses, Shimon Ullman
103
Voted
MFCS
2010
Springer
15 years 9 days ago
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
Stefan Kratsch, Dániel Marx, Magnus Wahlstr...
TVCG
2012
182views Hardware» more  TVCG 2012»
13 years 4 months ago
ISP: An Optimal Out-of-Core Image-Set Processing Streaming Architecture for Parallel Heterogeneous Systems
—Image population analysis is the class of statistical methods that plays a central role in understanding the development, evolution and disease of a population. However, these t...
Linh K. Ha, Jens Krüger, João Luiz Dih...