Sciweavers

49 search results - page 3 / 10
» A Modular Approach to Roberts' Theorem
Sort
View
TIT
2002
87views more  TIT 2002»
13 years 5 months ago
Coding theorems for turbo code ensembles
This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles of parallel and serial turbo codes are "good" in the following sense. For a tur...
Hui Jin, Robert J. McEliece
COLING
2000
13 years 6 months ago
Integrating Text Planning and Linguistic Choice Without Abandoning Modularity: The IGEN Generator
s; these annotations provide an abstract description of the effects of particular linguistic choices, allowing the planner to evaluate these choiceswithout needing any linguistic k...
Robert Rubinoff
WG
2007
Springer
14 years 10 days ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
TKDE
2008
121views more  TKDE 2008»
13 years 6 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
PLDI
2011
ACM
12 years 9 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...