Sciweavers

577 search results - page 64 / 116
» Computing Rational Bisectors
Sort
View
WWW
2005
ACM
14 years 8 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
IEEEIAS
2009
IEEE
14 years 2 months ago
Network Security Situation Awareness Using Exponential and Logarithmic Analysis
: Network security situation awareness (NSSA) is a hotspot in the network security research field, and it’s the perception, comprehension, and forecast of network security situat...
Xiaobin Tan, Qin Guihong, Zhang Yong, Liang Ping
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
14 years 2 months ago
Better with Byzantine: Manipulation-Optimal Mechanisms
Abstract. A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anythin...
Abraham Othman, Tuomas Sandholm
SIGCOMM
2009
ACM
14 years 2 months ago
Apprehending joule thieves with cinder
Energy is the critical limiting resource to mobile computing devices. Correspondingly, an operating system must track, provision, and ration how applications consume energy. The e...
Stephen M. Rumble, Ryan Stutsman, Philip Levis, Da...
TAMC
2007
Springer
14 years 2 months ago
On Deciding Deep Holes of Reed-Solomon Codes
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
Qi Cheng, Elizabeth Murray