Sciweavers

3778 search results - page 224 / 756
» Representing Web Graphs
Sort
View
CANDT
2009
15 years 10 months ago
Measuring self-focus bias in community-maintained knowledge repositories
Self-focus is a novel way of understanding a type of bias in community-maintained Web 2.0 graph structures. It goes beyond previous measures of topical coverage bias by encapsulat...
Brent Hecht, Darren Gergle
ICPR
2010
IEEE
15 years 9 months ago
Topic-Sensitive Tag Ranking
Social tagging is an increasingly popular way to describe and classify documents on the web. However, the quality of the tags varies considerably since the tags are authored freel...
Yan'An Jin, Ruixuan Li, Zhengding Lu, Kunmei Wen, ...
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
16 years 6 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
CVPR
2007
IEEE
16 years 8 months ago
On-line Simultaneous Learning and Tracking of Visual Feature Graphs
Model learning and tracking are two important topics in computer vision. While there are many applications where one of them is used to support the other, there are currently only...
Arnaud Declercq, Justus H. Piater
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
16 years 26 days ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer