Sciweavers

CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 8 months ago
On the Index Coding Problem and its Relation to Network Coding and Matroid Theory
Salim Y. El Rouayheb, Alexander Sprintson, Costas ...
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 8 months ago
Planar Visibility Counting
Matthias Fischer, Matthias Hilbig, Claudius Jä...
CORR
2008
Springer
81views Education» more  CORR 2008»
13 years 8 months ago
Complexity Classes as Mathematical Axioms
Michael H. Freedman
CORR
2008
Springer
185views Education» more  CORR 2008»
13 years 8 months ago
Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
Yong Zhao, Ioan Raicu, Ian T. Foster, Mihael Hateg...
CORR
2008
Springer
193views Education» more  CORR 2008»
13 years 8 months ago
Faster and better: a machine learning approach to corner detection
The repeatability and efficiency of a corner detector determines how likely it is to be useful in a real-world application. The repeatability is importand because the same scene vi...
Edward Rosten, Reid Porter, Tom Drummond
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 8 months ago
Interference Channels with Correlated Receiver Side Information
The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver ...
Nan Liu, Deniz Gündüz, Andrea J. Goldsmi...
CORR
2008
Springer
66views Education» more  CORR 2008»
13 years 8 months ago
The decline in the concentration of citations, 1900-2007
Vincent Larivière, Yves Gingras, Éri...
CORR
2008
Springer
63views Education» more  CORR 2008»
13 years 8 months ago
How to Integrate a Polynomial over a Simplex
Velleda Baldoni, Nicole Berline, Jesús A. D...
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 8 months ago
Linear Time Encoding of LDPC Codes
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
Jin Lu, José M. F. Moura
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 8 months ago
On combinations of local theory extensions
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
Viorica Sofronie-Stokkermans