2107 search results - page 152 / 422 » Computing Small Search Numbers in Linear Time |
123
Voted
RTAS
2010
IEEE
15 years 1 months ago
2010
IEEE
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is be...
132
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
178
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
We propose a new bilateral filtering algorithm with computational
complexity invariant to filter kernel size, socalled
O(1) or constant time in the literature. By showing
that a...
146
Voted
TC
2010
15 years 2 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...
123
Voted
TCC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...