Sciweavers

2001 search results - page 88 / 401
» An Update on Generalized Information Theory
Sort
View
DAMON
2008
Springer
14 years 11 months ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross
RECSYS
2009
ACM
15 years 4 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
ICALP
1999
Springer
15 years 2 months ago
Average-Case Complexity of Shellsort
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
Tao Jiang, Ming Li, Paul M. B. Vitányi
ECAI
1992
Springer
15 years 2 months ago
Phenomenology, Representations and Complexity
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
Achim G. Hoffmann
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
15 years 10 months ago
Differential privacy and robust statistics
We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradig...
Cynthia Dwork, Jing Lei