Sciweavers

8695 search results - page 149 / 1739
» Making the Complex Simple
Sort
View
93
Voted
DAGSTUHL
2003
15 years 2 months ago
Genetic Design: Amplifying Our Ability to Deal With Requirements Complexity
Individual functional requirements represent fragments of behavior, while a design that satisfies a set of functional requirements represents integrated behavior. This perspective ...
R. Geoff Dromey
99
Voted
UAI
1998
15 years 2 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
101
Voted
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
14 years 7 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
113
Voted
AMC
2007
108views more  AMC 2007»
15 years 28 days ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
103
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 7 months ago
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
Davide Schipani, Michele Elia, Joachim Rosenthal