Sciweavers

165 search results - page 6 / 33
» Graph Partitioning Based on Link Distributions
Sort
View
SIGIR
2004
ACM
14 years 29 days ago
Block-level link analysis
Link Analysis has shown great potential in improving the performance of web search. PageRank and HITS are two of the most popular algorithms. Most of the existing link analysis al...
Deng Cai, Xiaofei He, Ji-Rong Wen, Wei-Ying Ma
IPPS
2007
IEEE
14 years 1 months ago
A Key-based Adaptive Transactional Memory Executor
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
Tongxin Bai, Xipeng Shen, Chengliang Zhang, Willia...
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
14 years 2 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
ICMCS
2007
IEEE
125views Multimedia» more  ICMCS 2007»
14 years 1 months ago
A Framework for Provisioning Overlay Network Based Multimedia Distribution Services
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
Dewan Tanvir Ahmed, Shervin Shirmohammadi
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
14 years 24 days ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...