Sciweavers

5115 search results - page 818 / 1023
» On Randomized Lanczos Algorithms
Sort
View
EOR
2007
101views more  EOR 2007»
15 years 6 months ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme
JUCS
2006
123views more  JUCS 2006»
15 years 6 months ago
Persian/Arabic Baffletext CAPTCHA
: Nowadays, many daily human activities such as education, trade, talks, etc are done by using the Internet. In such things as registration on Internet web sites, hackers write pro...
Mohammad Hassan Shirali-Shahreza, Mohammad Shirali...
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
15 years 6 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 6 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
TJS
2002
160views more  TJS 2002»
15 years 6 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