Sciweavers

5580 search results - page 861 / 1116
» Randomized priority algorithms
Sort
View
INFOCOM
2007
IEEE
15 years 8 months ago
Small Active Counters
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
Rade Stanojevic
SBACPAD
2007
IEEE
128views Hardware» more  SBACPAD 2007»
15 years 8 months ago
Node Level Primitives for Parallel Exact Inference
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...
Yinglong Xia, Viktor K. Prasanna
114
Voted
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
15 years 8 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
15 years 8 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
HIPC
2007
Springer
15 years 8 months ago
Distributed Ranked Search
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...