Sciweavers

CORR
2010
Springer
45views Education» more  CORR 2010»
13 years 9 months ago
Subset feedback vertex set is fixed parameter tractable
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, J...
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 9 months ago
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
Jin-yi Cai, Sangxia Huang, Pinyan Lu
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 9 months ago
When Feedback Doubles the Prelog in AWGN Networks
We demonstrate that the sum-rate capacity of a memoryless Gaussian network at high signal-to-signal ratio (SNR) can be asymptotically doubled when feedback is available. To demonst...
Michael Gastpar, Amos Lapidoth, Michele A. Wigger
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 9 months ago
Comparing Repository Types - Challenges and barriers for subject-based repositories, research repositories, national repository
After two decades of repository development, some conclusions may be drawn as to which type of repository and what kind of service best supports digital scholarly communication, a...
Chris Armbruster, Laurent Romary
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 9 months ago
Using Information Theory to Study the Efficiency and Capacity of Computers and Similar Devices
We address the problems of estimating the computer efficiency and the computer capacity. We define the computer efficiency and capacity and suggest a method for their estimation, ...
Boris Ryabko
CORR
2010
Springer
44views Education» more  CORR 2010»
13 years 9 months ago
Structural Analysis of Boolean Equation Systems
Jeroen Keiren, Michel A. Reniers, Tim A. C. Willem...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 9 months ago
On the Minimal Uncompletable Word Problem
Let S be a finite set of words such that Fact(S ) = . We deal with the problem of finding bounds on the minimal length of words in \ Fact(S ) in terms of the maximal length of wor...
Gabriele Fici, Elena V. Pribavkina, Jacques Sakaro...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 9 months ago
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...
Michal Nánási, Tomás Vinar, B...
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 9 months ago
Extending INET Framework for Directional and Asymmetrical Wireless Communications
This paper reports our work on extending the OMNeT++ INET Framework with a directional radio model, putting a special emphasis on the implementation of asymmetrical communications...
Paula Uribe, Juan Carlos Maureira Bravo, Olivier D...
CORR
2010
Springer
45views Education» more  CORR 2010»
13 years 9 months ago
On Achievable Rates for Non-Linear Deterministic Interference Channels
Amin Jafarian, Sriram Vishwanath