Sciweavers

583 search results - page 33 / 117
» Computing Linking Numbers of a Filtration
Sort
View
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
13 years 10 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
CIKM
2004
Springer
14 years 3 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
ACSC
2008
IEEE
13 years 12 months ago
An efficient hash-based algorithm for minimal k-anonymity
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such a...
Xiaoxun Sun, Min Li, Hua Wang, Ashley W. Plank
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
14 years 2 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
HPCC
2007
Springer
14 years 4 months ago
The One-Click Grid-Resource Model
This paper introduces the One-Click Grid resource, which allows any computer with a Java enabled web browser to safely provide resources to Grid without any software installation. ...
Martin Rehr, Brian Vinter