Sciweavers

247 search results - page 8 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
ESOP
2009
Springer
14 years 2 months ago
All Secrets Great and Small
Tools for analysing secure information flow are almost exclusively based on ideas going back to Denning’s work from the 70’s. This approach embodies an imperfect notion of sec...
Delphine Demange, David Sands
CORR
2012
Springer
173views Education» more  CORR 2012»
12 years 3 months ago
A new approach to the orientation of random hypergraphs
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
Marc Lelarge
ICASSP
2010
IEEE
13 years 2 months ago
Unsupervised knowledge acquisition for Extracting Named Entities from speech
This paper presents a Named Entity Recognition (NER) method dedicated to process speech transcriptions. The main principle behind this method is to collect in an unsupervised way ...
Frédéric Béchet, Eric Charton
ICASSP
2011
IEEE
12 years 11 months ago
Automatic minute generation for parliamentary speech using conditional random fields
We show a novel approach of automatically generating minutes style extractive summaries for parliamentary speech. Minutes are structured summaries consisting of sequences of busin...
Justin Jian Zhang, Pascale Fung, Ricky Ho Yin Chan
MOBICOM
2003
ACM
14 years 22 days ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas