356 search results - page 35 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
115
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
107
click to vote
TOC
2008
15 years 9 days ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
102
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
134
click to vote
WSCG
2003
15 years 1 months ago
2003
This paper presents work we have done in detecting moving shadows in the context of an outdoor traffic scene for visual surveillance purposes. The algorithm just exploits some for...
116
click to vote
SGP
2004
15 years 2 months ago
2004
Most 3D mesh generation techniques require simplification and mesh improvement stages to prepare a tetrahedral model for efficient simulation. We have developed an algorithm that ...