Sciweavers

8824 search results - page 1496 / 1765
» On the Complexity of Real Functions
Sort
View
CSCW
2011
ACM
15 years 1 months ago
Towards quality discourse in online news comments
With the growth in sociality and interaction around online news media, news sites are increasingly becoming places for communities to discuss and address common issues spurred by ...
Nicholas Diakopoulos, Mor Naaman
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 1 months ago
Reed Muller Sensing Matrices and the LASSO
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
A. Robert Calderbank, Sina Jafarpour
CORR
2010
Springer
158views Education» more  CORR 2010»
15 years 1 months ago
Efficient Approaches for Designing Fault Tolerant Reversible Carry Look-Ahead and Carry-Skip Adders
Combinational or Classical logic circuits dissipate heat for every bit of information that is lost. Information is lost when the input vector cannot be recovered from its correspon...
Md. Saiful Islam 0003, Muhammad Mahbubur Rahman, Z...
MIA
2011
125views more  MIA 2011»
15 years 1 months ago
A review of segmentation methods in short axis cardiac MR images
For the last 15 years, Magnetic Resonance Imaging (MRI) has become a reference examination for cardiac morphology, function and perfusion in humans. Yet, due to the characteristic...
Caroline Petitjean, Jean-Nicolas Dacher
TIT
2011
131views more  TIT 2011»
15 years 1 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
« Prev « First page 1496 / 1765 Last » Next »