Sciweavers

8695 search results - page 99 / 1739
» Making the Complex Simple
Sort
View
PPOPP
1995
ACM
14 years 1 months ago
pC++/streams: a Library for I/O on Complex Distributed Data Structures
paper we describe d/streams, a language-independent abstraction with a small set of simple primitives for buffered I/O on distributed data-structures. We describe the interface an...
Jacob Gotwals, Suresh Srinivas, Dennis Gannon
NIPS
2007
13 years 11 months ago
Expectation Maximization and Posterior Constraints
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
João Graça, Kuzman Ganchev, Ben Task...
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 7 months ago
A Note on Solid Coloring of Pure Simplicial Complexes
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in Rd may be colored with d+1 colors so that no two simplices tha...
Joseph O'Rourke
WSC
1998
13 years 11 months ago
Input Modeling Tools for Complex Problems
A simulation model is composed of inputs and logic; the inputs represent the uncertainty or randomness in the system, while the logic determines how the system reacts to the uncer...
Barry L. Nelson, Michael Yamnitsky
MST
2011
237views Hardware» more  MST 2011»
13 years 4 months ago
On the Complexity of Computing Winning Strategies for Finite Poset Games
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
Michael Soltys, Craig Wilson