Sciweavers

4074 search results - page 326 / 815
» Abstract Graph Transformation
Sort
View
ESANN
2001
15 years 8 months ago
Graph extraction from color images
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...
Tino Lourens, Kazuhiro Nakadai, Hiroshi G. Okuno, ...
WAW
2010
Springer
231views Algorithms» more  WAW 2010»
15 years 4 months ago
Modeling Traffic on the Web Graph
Abstract. Analysis of aggregate and individual Web requests shows that PageRank is a poor predictor of traffic. We use empirical data to characterize properties of Web traffic not ...
Mark R. Meiss, Bruno Gonçalves, Jose J. Ram...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
16 years 16 hour ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 6 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
JCT
2010
79views more  JCT 2010»
15 years 5 months ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender