Sciweavers

1399 search results - page 194 / 280
» Multi-party Finite Computations
Sort
View
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 1 months ago
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
Florian Richoux
MMAS
2010
Springer
14 years 11 months ago
Incorporating Active Transport of Cellular Cargo in Stochastic Mesoscopic Models of Living Cells
We propose a new multiscale method to incorporate active transport of cargo particles in biological cells in stochastic, mesoscopic models of reaction-transport processes. Given a...
Andreas Hellander, Per Lötstedt
SIAMSC
2010
116views more  SIAMSC 2010»
14 years 11 months ago
Optimized Schwarz Waveform Relaxation for the Primitive Equations of the Ocean
In this article we are interested in the derivation of efficient domain decomposition methods for the viscous primitive equations of the ocean. We consider the rotating 3d incompre...
Emmanuel Audusse, Pierre Dreyfuss, Benoit Merlet
TNN
2010
216views Management» more  TNN 2010»
14 years 11 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
TSP
2010
14 years 11 months ago
Two-channel linear phase FIR QMF bank minimax design via global nonconvex optimization programming
In this correspondence, a two-channel linear phase finite impulse response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimizati...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Lamia ...