Sciweavers

5153 search results - page 826 / 1031
» Introduction to Randomized Algorithms
Sort
View
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
15 years 3 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
15 years 3 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
162
Voted
TJS
2002
160views more  TJS 2002»
15 years 3 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
WINET
2002
163views more  WINET 2002»
15 years 3 months ago
TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...
Claudio Casetti, Mario Gerla, Saverio Mascolo, M. ...
115
Voted
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 22 days ago
Calibration for Ultrasound Breast Tomography Using Matrix Completion
We study the calibration problem in circular ultrasound tomography devices for breast imaging, where the sensor positions deviate from the circumference of a perfect circle. We in...
Reza Parhizkar, Amin Karbasi, Sewoong Oh, Martin V...