2925 search results - page 113 / 585 » Information Complexity of Online Problems |
158
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
168
click to vote
ASPLOS
2006
ACM
16 years 11 days ago
2006
ACM
Memory leaks compromise availability and security by crippling performance and crashing programs. Leaks are difficult to diagnose because they have no immediate symptoms. Online ...
186
click to vote
SAC
2004
ACM
15 years 12 months ago
2004
ACM
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
185
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
168
click to vote
ACISP
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...