: Bounds on the Size of Small Depth Circuits for Approximating Majority.
: New Algorithms and Lower Bounds for Sequential-Access Data Compression.
B. Baykant Alagoz
: Hierarchical Triple-Modular Redundancy (H-TMR) Network For Digital Systems.
Keith M. Martin
: On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks.
, Xintao Liu
: AxialGen: A Research Prototype for Automatically Generating the Axial Map.
, Andrea De Giusti
: Binary Data Compression with and without Side Information at the Decoder: the Syndrome-Based Approach Using Off-the-Shelf Turbo Codecs.
James D. Myers
, Joe Futrelle
, Jeff Gaynor
, Joel Plutchak
, Peter Bajcsy
, Jason Kastner
, Kailash Kotwani
, Jong Sung Lee
, Luigi Marini
, Rob Kooper
, Robert E. McGrath
, Terry McLaren
, Alejandro Rodríguez
, Yong Liu
: Embedding Data within Knowledge Spaces.
: A Simple Extraction Procedure for Bibliographical Author Field.
: Genetic algorithm based optimization and post optimality analysis of multi-pass face milling.
Mark F. Flanagan
: A Unified Framework for Linear-Programming Based Communication Receivers.
: Towards a Statistical Methodology to Evaluate Program Speedups and their Optimisation Techniques.
: How happy is your web browsing? A probabilistic model to describe user satisfaction.
: Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information.
, A. Kucerova
: Improvements of real coded genetic algorithms based on differential operators preventing premature convergence.
: Counting Distinctions: On the Conceptual Foundations of Shannon's Information Theory.
, Sylvain Perifel
: A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent.
: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time.
: NNRU, a noncommutative analogue of NTRU.
: Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence.
: A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints.