Sciweavers

5153 search results - page 229 / 1031
» Introduction to Randomized Algorithms
Sort
View
CORR
2006
Springer
147views Education» more  CORR 2006»
15 years 3 months ago
ARQ Diversity in Fading Random Access Channels
A cross-layer optimization approach is adopted for the design of symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical la...
Young-Han Nam, Praveen Kumar Gopala, Hesham El Gam...
IGPL
2006
87views more  IGPL 2006»
15 years 3 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
Eli Shamir
CORR
2007
Springer
146views Education» more  CORR 2007»
15 years 3 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 3 months ago
Competitive minimax universal decoding for several ensembles of random codes
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
Yaniv Akirav, Neri Merhav
DKE
2002
107views more  DKE 2002»
15 years 3 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias