Sciweavers

139 search results - page 19 / 28
» Reducibilities Relating to Schnorr Randomness
Sort
View
PKC
2007
Springer
125views Cryptology» more  PKC 2007»
14 years 3 months ago
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
Takashi Nishide, Kazuo Ohta
INFOCOM
2003
IEEE
14 years 3 months ago
Distributed Queueing in Scalable High Performance Routers
—This paper presents and evaluates distributed queueing algorithms for regulating the flow of traffic through large, high performance routers. Distributed queueing has a similar ...
Prashanth Pappu, Jyoti Parwatikar, Jonathan S. Tur...
DAMON
2008
Springer
13 years 11 months ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross
NIPS
2007
13 years 11 months ago
Fast and Scalable Training of Semi-Supervised CRFs with Application to Activity Recognition
We present a new and efficient semi-supervised training method for parameter estimation and feature selection in conditional random fields (CRFs). In real-world applications suc...
Maryam Mahdaviani, Tanzeem Choudhury
ACL
2006
13 years 11 months ago
Combining Statistical and Knowledge-Based Spoken Language Understanding in Conditional Models
Spoken Language Understanding (SLU) addresses the problem of extracting semantic meaning conveyed in an utterance. The traditional knowledge-based approach to this problem is very...
Ye-Yi Wang, Alex Acero, Milind Mahajan, John Lee