Sciweavers

137 search results - page 5 / 28
» National Science Foundation Graduate Research Fellowship Pro...
Sort
View
FOCS
1989
IEEE
13 years 11 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
CN
2006
109views more  CN 2006»
13 years 7 months ago
Quality of service provisioning for composable routing elements
Quality of service (QoS) provisioning for dynamically composable software elements in a programmable router has not received much attention. We present a router platform that supp...
Seung Chul Han, Puneet Zaroo, David K. Y. Yau, Yu ...
ECCC
2008
108views more  ECCC 2008»
13 years 7 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
EUROSYS
2007
ACM
14 years 4 months ago
Antiquity: exploiting a secure log for wide-area distributed storage
Antiquity is a wide-area distributed storage system designed to provide a simple storage service for applications like file systems and back-up. The design assumes that all serve...
Hakim Weatherspoon, Patrick R. Eaton, Byung-Gon Ch...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts