Sciweavers

4052 search results - page 542 / 811
» Computing personalized pageranks
Sort
View
IICS
2010
Springer
15 years 10 months ago
Self-Organizing Ant-based Information Gossiping Algorithm for P2P Networks
They appeared in our life only few years ago and now they are everywhere: computers have become ubiquitous and, almost, irreplaceable. Classical ways of creating, managing and exch...
Christophe Guéret, Nicolas Monmarché...
SC
1995
ACM
15 years 10 months ago
Analysis of Multilevel Graph Partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
George Karypis, Vipin Kumar
MOBISYS
2010
ACM
15 years 9 months ago
GreenGPS: a participatory sensing fuel-efficient maps application
This paper develops a navigation service, called GreenGPS, that uses participatory sensing data to map fuel consumption on city streets, allowing drivers to find the most fueleffi...
Raghu K. Ganti, Nam Pham, Hossein Ahmadi, Saurabh ...
201
Voted
ASPLOS
2008
ACM
15 years 8 months ago
Tapping into the fountain of CPUs: on operating system support for programmable devices
The constant race for faster and more powerful CPUs is drawing to a close. No longer is it feasible to significantly increase the speed of the CPU without paying a crushing penalt...
Yaron Weinsberg, Danny Dolev, Tal Anker, Muli Ben-...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 6 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna