Sciweavers

428 search results - page 12 / 86
» Completeness of a Fact Extractor
Sort
View
70
Voted
CCS
2000
ACM
15 years 1 months ago
PRUNES: an efficient and complete strategy for automated trust negotiation over the Internet
The Internet provides an environment where two parties, who are virtually strangers to each other, can make connections and do business together. Before any actual business starts...
Ting Yu, Xiaosong Ma, Marianne Winslett
IJCM
2002
97views more  IJCM 2002»
14 years 9 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
15 years 10 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
APPROX
2005
Springer
79views Algorithms» more  APPROX 2005»
15 years 3 months ago
Reconstructive Dispersers and Hitting Set Generators
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
Christopher Umans
ICASSP
2011
IEEE
14 years 1 months ago
Well-calibrated heavy tailed Bayesian speaker verification for microphone speech
The work presented in this paper is an extension of our two previous works [1, 2]. In the first paper [1], we proposed a low dimensional feature (i-vectors) extractor which is su...
Mohammed Senoussaoui, Patrick Kenny, Pierre Dumouc...