CORR
2010
Springer
13 years 11 months ago
2010
Springer
A (n,d,e), the smallest for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size up to radius e, is determined for all d 2e...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract: This document contains the Intellectual Property Statement and the technical description of the MQQ-SIG - a new public key digital signature scheme. The complete scientif...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We develop sub-Nyquist sampling systems for analog signals comprised of several, possibly overlapping, finite duration pulses with unknown shapes and time positions. Efficient sam...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypot...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
: Cloud infrastructures enable the efficient parallel execution of data-intensive tasks such as entity resolution on large datasets. We investigate challenges and possible solution...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
An analytical framework for performance analysis and optimization of coded V-BLAST is developed. Average power and/or rate allocations to minimize the outage probability as well as...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
This paper examines the relationship between gestures' function and form in design collaboration. It adopts a cognitive design research viewpoint. The analysis is restricted t...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
ion for Epistemic Model Checking of Dining Cryptographers-based Protocols Omar I. Al-Bataineh and Ron van der Meyden School of Computer Science and Engineering, University of New S...