Sciweavers

5214 search results - page 226 / 1043
» The Online Specialization Problem
Sort
View
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
14 years 8 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
IACR
2011
104views more  IACR 2011»
14 years 5 months ago
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...
Seung Geol Choi, Kyung-Wook Hwang, Jonathan Katz, ...
ICASSP
2008
IEEE
16 years 12 days ago
Kerdock codes for limited feedback MIMO systems
A codebook based limited feedback strategy is a practical way to obtain partial channel state information at the transmitter in a precoded multiple-input multiple-output (MIMO) wi...
Takao Inoue, Robert W. Heath Jr.
158
Voted
NRHM
1998
124views more  NRHM 1998»
15 years 5 months ago
Adaptable and adaptive information provision for all users, including disabled and elderly people
: Due to the tremendously increasing popularity of the World-Wide Web, hypermedia is going to be the leading online information medium for some years to come and will most likely b...
Josef Fink, Alfred Kobsa, Andreas Nill
INFOCOM
2009
IEEE
16 years 18 days ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...