Sciweavers

5153 search results - page 776 / 1031
» Introduction to Randomized Algorithms
Sort
View
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
16 years 24 days ago
Semi-supervised Clustering Using Bayesian Regularization
Text clustering is most commonly treated as a fully automated task without user supervision. However, we can improve clustering performance using supervision in the form of pairwi...
Zuobing Xu, Ram Akella, Mike Ching, Renjie Tang
ICMCS
2007
IEEE
120views Multimedia» more  ICMCS 2007»
16 years 24 days ago
On the Error Resilience of Rate Smoothing using Explicit Slice-Based Mode Selection
An encoder based rate smoothing scheme which uses explicit slicebased mode selection has been proposed recently. The algorithm provides significantly smoother bitstream from a va...
Yuan Lin, Anna N. Kim, Eren Gürses, Andrew Pe...
INFOCOM
2007
IEEE
16 years 24 days 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»
16 years 23 days 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
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
16 years 20 days 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...