Sciweavers

3146 search results - page 21 / 630
» Efficient Consequence Finding
Sort
View
CRYPTO
2007
Springer
172views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
Deterministic and Efficiently Searchable Encryption
We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic. We ob...
Mihir Bellare, Alexandra Boldyreva, Adam O'Neill
BMVC
2001
13 years 10 months ago
Finding Paths in Video Sequences
This paper investigates the task of identifying frequently-used pathways from video sequences of natural outdoor scenes. Path models are adaptively learnt from the accumulation of...
Dimitrios Makris, Tim Ellis
DSD
2004
IEEE
126views Hardware» more  DSD 2004»
13 years 11 months ago
Boolean Minimizer FC-Min: Coverage Finding Process
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
Petr Fiser, Hana Kubatova
ICALP
1994
Springer
13 years 11 months ago
Finding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
Raphael Yuster, Uri Zwick
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney