Sciweavers

5158 search results - page 812 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
IACR
2011
152views more  IACR 2011»
14 years 6 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
SIGCOMM
2012
ACM
13 years 9 months ago
Route shepherd: stability hints for the control plane
The Route Shepherd tool demonstrates applications of choosing between routing protocol configurations on the basis of rigorouslysupported theory. Splitting the configuration spa...
Alexander J. T. Gurney, Xianglong Han, Yang Li, Bo...
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 9 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
JMLR
2012
13 years 9 months ago
Domain Adaptation: A Small Sample Statistical Approach
We study the prevalent problem when a test distribution differs from the training distribution. We consider a setting where our training set consists of a small number of sample d...
Ruslan Salakhutdinov, Sham M. Kakade, Dean P. Fost...
CL
2012
Springer
13 years 9 months ago
Maintaining distributed logic programs incrementally
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedr...