Sciweavers

478 search results - page 29 / 96
» Improving probability bounds by optimization over subsets
Sort
View
PODC
1997
ACM
13 years 11 months ago
The Load and Availability of Byzantine Quorum Systems
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool
CORR
2011
Springer
186views Education» more  CORR 2011»
12 years 11 months ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...
PERCOM
2005
ACM
14 years 7 months ago
MASTAQ: A Middleware Architecture for Sensor Applications with Statistical Quality Constraints
We present the design goals and functional components of MASTAQ, a data management middleware for pervasive applications that utilize sensor data. MASTAQ allows applications to sp...
Inseok Hwang, Qi Han, Archan Misra
NAACL
2010
13 years 5 months ago
Relaxed Marginal Inference and its Application to Dependency Parsing
Recently, relaxation approaches have been successfully used for MAP inference on NLP problems. In this work we show how to extend the relaxation approach to marginal inference use...
Sebastian Riedel, David A. Smith
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 25 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen