9821 search results - page 1964 / 1965 » A Framework for the Development of Protocols |
122
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
203
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
104
click to vote
TVCG
2012
13 years 2 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
134
click to vote
ACL
2012
13 years 2 months ago
2012
Understanding the ways in which information achieves widespread public awareness is a research question of significant interest. We consider whether, and how, the way in which th...
101
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...