Sciweavers

3778 search results - page 350 / 756
» Representing Web Graphs
Sort
View
CORR
2012
Springer
249views Education» more  CORR 2012»
14 years 2 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
CIKM
2008
Springer
15 years 8 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 8 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
WWW
2009
ACM
16 years 1 months ago
Mining cultural differences from a large number of geotagged photos
We propose a novel method to detect cultural differences over the world automatically by using a large amount of geotagged images on the photo sharing Web sites such as Flickr. W...
Keiji Yanai, Bingyu Qiu
ICMCS
2008
IEEE
115views Multimedia» more  ICMCS 2008»
16 years 1 months ago
Spatial pyramid mining for logo detection in natural scenes
This work introduces a novel data mining scheme, spatial pyramid mining, to discover association rules at multiple resolutions in order to identify frequent spatial configuration...
Jim Kleban, Xing Xie, Wei-Ying Ma