3757 search results - page 397 / 752 » The overlap number of a graph |
170
Voted
WAOA
2005
Springer
16 years 7 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
167
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
188
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...
294
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Local appearance models in the neighborhood of salient image features, together with local and/or global geometric constraints, serve as the basis for several recent and effective...
283
click to vote
ICDE
2000
IEEE
16 years 8 months ago
2000
IEEE
In this paper, we develop and test an approach to retrieving images from an image database based on content similarity. First, each picture is divided into many overlapping region...