Sciweavers

1221 search results - page 82 / 245
» A Comparison of Two Programming Models for Pervasive Computi...
Sort
View
DAC
1999
ACM
16 years 4 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
147
Voted
SAC
2011
ACM
14 years 10 months ago
Slice sampling mixture models
We propose a more efficient version of the slice sampler for Dirichlet process mixture models described by Walker (2007). This sampler allows the fitting of infinite mixture mod...
Maria Kalli, Jim E. Griffin, Stephen G. Walker
PPOPP
2005
ACM
15 years 8 months ago
Scaling model checking of dataraces using dynamic information
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...
Ohad Shacham, Mooly Sagiv, Assaf Schuster
115
Voted
HIPS
1998
IEEE
15 years 7 months ago
ZPL's WYSIWYG Performance Model
ZPL is a parallel array language designed for high performance scientific and engineering computations. Unlike other parallel languages, ZPL is founded on a machine he CTA) that a...
Bradford L. Chamberlain, Sung-Eun Choi, E. Christo...
ACL
2012
13 years 5 months ago
Labeling Documents with Timestamps: Learning from their Time Expressions
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
Nathanael Chambers