2638 search results - page 428 / 528 » Random Geometric Complexes |
154
click to vote
TJS
2002
15 years 1 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...
101
click to vote
JCT
2010
15 years 22 days 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...
135
click to vote
TC
2010
15 years 20 days 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...
133
Voted
TPDS
2010
15 years 20 days 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...
120
Voted
ECCC
2010
14 years 11 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...