Sciweavers

106 search results - page 21 / 22
» Almost random graphs with simple hash functions
Sort
View
QEST
2010
IEEE
13 years 5 months ago
On the Theory of Stochastic Processors
Traditional architecture design approaches hide hardware uncertainties from the software stack through overdesign, which is often expensive in terms of power consumption. The recen...
Parasara Sridhar Duggirala, Sayan Mitra, Rakesh Ku...
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 8 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 3 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
INTERNET
2010
119views more  INTERNET 2010»
13 years 5 months ago
A Chat Application in Lift
s the HTTP request–response cycle rather than wrapping HTTP concepts in APIs. This means you put HTML element definition and action in the same place: var name = "" SHt...
David Pollak, Steve Vinoski
SIGLEX
1991
13 years 11 months ago
Logical Structures in the Lexicon
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
John F. Sowa