4926 search results - page 458 / 986 » Two Graph Algorithms On an Associative Computing Model |
117
Voted
WSC
2007
15 years 6 months ago
2007
A new approach for overcoming broken ergodicity in Markov Chain Monte Carlo (MCMC) simulations of complex systems is described. The problem of broken ergodicity is often present i...
142
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Identifying genes and pathways associated with diseases such as cancer has been a subject of considerable research in recent years in the area of bioinformatics and co...
152
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
126
Voted
PG
2003
IEEE
15 years 9 months ago
2003
IEEE
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
226
Voted
EICS
2011
ACM
14 years 7 months ago
2011
ACM
This paper describes a model-based approach for designing distributed user interfaces (DUIs), i.e. graphical user interfaces that are distributed along one or many of the followin...