1461 search results - page 202 / 293 » Complexity of Graph Covering Problems |
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
ECCC
2006
13 years 9 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
WG
2005
Springer
14 years 2 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...