Sciweavers

945 search results - page 131 / 189
» Graph Types
Sort
View
112
Voted
TIT
2002
77views more  TIT 2002»
15 years 2 months ago
Capacity-achieving sequences for the erasure channel
Abstract-- This paper starts a systematic study of capacityachieving sequences of low-density parity-check codes for the erasure channel. We introduce a class Aof analytic function...
P. Oswald, A. Shokrollahi
JOT
2010
173views more  JOT 2010»
15 years 1 months ago
A Dependence Representation for Coverage Testing of Object-Oriented Programs
Abstract We propose a dependence-based representation for object-oriented programs, named Call-based Object-Oriented System Dependence Graph (COSDG). Apart from structural features...
E. S. F. Najumudheen, Rajib Mall, Debasis Samanta
TCS
2010
15 years 28 days ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
114
Voted
ICCV
2009
IEEE
15 years 9 days ago
Minimizing energy functions on 4-connected lattices using elimination
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...
Peter Carr, Richard Hartley
132
Voted
APAL
2011
14 years 9 months ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...