Sciweavers

6142 search results - page 351 / 1229
» The Complexity of Partition Functions
Sort
View
220
Voted
MCS
2007
Springer
15 years 7 months ago
Parallel unstructured mesh generation by an advancing front method
Mesh generation is a critical step in high fidelity computational simulations. High-quality and high-density meshes are required to accurately capture the complex physical phenome...
Yasushi Ito, Alan M. Shih, Anil K. Erukala, Bharat...
TSP
2010
15 years 2 months ago
Low-complexity decoding via reduced dimension maximum-likelihood search
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer, Nam...
247
Voted
ICDE
2012
IEEE
224views Database» more  ICDE 2012»
13 years 10 months ago
Exploiting Common Subexpressions for Cloud Query Processing
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
Yasin N. Silva, Paul-Ake Larson, Jingren Zhou
ICCS
2004
Springer
16 years 26 days ago
Towards a Generalised Runtime Environment for Parallel Haskells
Abstract. Implementations of parallel dialects (or: coordination languages) on a functional base (or: computation) language always have to extend complex runtime environments by th...
Jost Berthold
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 7 months ago
Statistical and Computational Tradeoffs in Stochastic Composite Likelihood
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...
Joshua Dillon, Guy Lebanon