Sciweavers

7228 search results - page 666 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
210
Voted
DEBU
2010
128views more  DEBU 2010»
15 years 4 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
192
Voted
TON
2010
99views more  TON 2010»
15 years 1 months ago
Rate Control With Pairwise Intersession Network Coding
In this paper, we develop a distributed rate-control algorithm for networks with multiple unicast sessions when network coding is allowed across different sessions. Building on rec...
Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff
WWW
2011
ACM
15 years 2 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 7 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 11 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam