Sciweavers

1664 search results - page 147 / 333
» Distance labeling in graphs
Sort
View
ICPR
2008
IEEE
16 years 5 months ago
Object localization using affine invariant substructure constraints
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
Ahmed M. Elgammal, Ishani Chakraborty
145
Voted
AIRWEB
2007
Springer
15 years 10 months ago
Transductive Link Spam Detection
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
Dengyong Zhou, Chris Burges, Tao Tao
FOCS
2009
IEEE
15 years 11 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
131
Voted
OPODIS
2008
15 years 6 months ago
Graph Augmentation via Metric Embedding
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
Emmanuelle Lebhar, Nicolas Schabanel
122
Voted
BILDMED
2007
112views Algorithms» more  BILDMED 2007»
15 years 6 months ago
Fully-Automatic Correction of the Erroneous Border Areas of an Aneurysm
Abstract. Volume representations of blood vessels acquired by 3D rotational angiography are very suitable for diagnosing an aneurysm. We presented a fully-automatic aneurysm labell...
Jan Bruijns, Frans J. Peters, Robert-Paul Berretty...