2638 search results - page 428 / 528 » Random Geometric Complexes |
TJS
2002
13 years 9 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
JCT
2010
13 years 8 months ago
2010
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
TC
2010
13 years 8 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
TPDS
2010
13 years 8 months ago
2010
—In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n À 1 destinations as well as download their respecti...
ECCC
2010
13 years 7 months ago
2010
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...