41 search results - page 6 / 9 » Vertex Sparsifiers: New Results from Old Techniques |
100
click to vote
ADHOC
2007
15 years 2 days ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
138
click to vote
ICALP
2009
Springer
16 years 6 days ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...
119
click to vote
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
We present a method for retexturing non-rigid objects from a single viewpoint. Without reconstructing 3D geometry, we create realistic video with shape cues at two scales. At a coa...
MOC
2011
14 years 6 months ago
2011
Abstract. We prove optimal order error estimates for the Raviart-Thomas interpolation of arbitrary order under the maximum angle condition for triangles and under two generalizatio...