Sciweavers

9997 search results - page 261 / 2000
» The case for crowd computing
Sort
View
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 6 months ago
Fast computation of power series solutions of systems of differential equations
We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...
Alin Bostan, Frédéric Chyzak, Fran&c...
DAM
2006
106views more  DAM 2006»
15 years 6 months ago
Computational complexity of isothermic DNA sequencing by hybridization
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
Jacek Blazewicz, Marta Kasprzak
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ICASSP
2011
IEEE
14 years 10 months ago
New results on adaptive computational resource allocation in soft MIMO detection
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
Mirsad Cirkic, Daniel Persson, Erik G. Larsson
IICS
2001
Springer
15 years 11 months ago
Computer-Supported Deliberations for Distributed Teams
In our terminology, a “deliberation” is a distributed collaborative process, more or less spontaneous, structured, and complex. This process can include both individual and col...
Jacques Lonchamp, Fabrice Muller