Sciweavers

CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 11 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 11 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 11 months ago
Restricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
Holger Rauhut, Justin K. Romberg, Joel A. Tropp
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 11 months ago
Implications of Inter-Rater Agreement on a Student Information Retrieval Evaluation
This paper is about an information retrieval evaluation on three different retrieval-supporting services. All three services were designed to compensate typical problems that aris...
Philipp Schaer, Philipp Mayr, Peter Mutschke
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 11 months ago
Modified Bully Algorithm using Election Commission
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
Muhammad Mahbubur Rahman, Afroza Nahar
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 11 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 11 months ago
Certifying cost annotations in compilers
We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the so...
Roberto M. Amadio, Nicholas Ayache, Yann Ré...
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 11 months ago
Automatic Verification of Parametric Specifications with Complex Topologies
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...
Johannes Faber, Carsten Ihlemann, Swen Jacobs, Vio...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 11 months ago
High-SIR Transmission Capacity of Wireless Networks with General Fading and Node Distribution
In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the l...
Radha Krishna Ganti, Jeffrey G. Andrews, Martin Ha...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 11 months ago
Real-Time Multi-path Tracking of Probabilistic Available Bandwidth
Applications such as traffic engineering and network provisioning can greatly benefit from knowing, in real time, what is the largest input rate at which it is possible to transmit...
Frederic Thouin, Mark Coates, Michael Rabbat