Sciweavers

297 search results - page 57 / 60
» Every Sequence Is Decompressible from a Random One
Sort
View
ICC
2009
IEEE
127views Communications» more  ICC 2009»
15 years 5 months ago
Security Games with Incomplete Information
—We study two-player security games which can be viewed as sequences of nonzero-sum matrix games where at each stage of the iterations the players make imperfect observations of ...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
91
Voted
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
15 years 6 days ago
On-Line Difference Maximization
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
Ming-Yang Kao, Stephen R. Tate
BMCBI
2011
14 years 5 months ago
Empirical Bayesian models for analysing molecular serotyping microarrays
Background: Microarrays offer great potential as a platform for molecular diagnostics, testing clinical samples for the presence of numerous biomarkers in highly multiplexed assay...
Richard Newton, Jason Hinds, Lorenz Wernisch
113
Voted
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
14 years 10 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
91
Voted
SIGIR
2009
ACM
15 years 5 months ago
Global ranking by exploiting user clicks
It is now widely recognized that user interactions with search results can provide substantial relevance information on the documents displayed in the search results. In this pape...
Shihao Ji, Ke Zhou, Ciya Liao, Zhaohui Zheng, Gui-...