Sciweavers

13214 search results - page 2397 / 2643
» Pseudorandomness for network algorithms
Sort
View
IUI
2009
ACM
16 years 3 months ago
You can play that again: exploring social redundancy to derive highlight regions in videos
Identifying highlights in multimedia content such as video and audio is currently a very difficult technical problem. We present and evaluate a novel algorithm that identifies hig...
Jose San Pedro, Vaiva Kalnikaité, Steve Whi...
158
Voted
CVPR
2010
IEEE
16 years 3 months ago
Parallel and Distributed Graph Cuts by Dual Decomposition
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
Petter Strandmark, Fredrik Kahl
WWW
2010
ACM
16 years 1 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
CISIS
2010
IEEE
16 years 1 months ago
Computational Grid as an Appropriate Infrastructure for Ultra Large Scale Software Intensive Systems
—Ultra large scale (ULS) systems are future software intensive systems that have billions of lines of code, composed of heterogeneous, changing, inconsistent and independent elem...
Babak Rezaei Rad, Fereidoon Shams Aliee
WISE
2009
Springer
16 years 1 months ago
Multi-synchronous Collaborative Semantic Wikis
Semantic wikis have opened an interesting way to mix Web 2.0 advantages with the Semantic Web approach. However, compared to other collaborative tools, wikis do not support all col...
Charbel Rahhal, Hala Skaf-Molli, Pascal Molli, St&...
« Prev « First page 2397 / 2643 Last » Next »