Sciweavers

47 search results - page 7 / 10
» On the Recognizability of Self-generating Sets
Sort
View
ESWA
2007
117views more  ESWA 2007»
13 years 7 months ago
An HMM for detecting spam mail
Hidden Markov Models, or HMMs for short, have been recently used in Bioinformatics for the classification of DNA or protein chains, giving rise to what is known as Profile Hidde...
José Gordillo, Eduardo Conde
ICALP
2010
Springer
14 years 10 days ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
TCSV
2008
102views more  TCSV 2008»
13 years 7 months ago
Semantic Analysis for Automatic Event Recognition and Segmentation of Wedding Ceremony Videos
Wedding is one of the most important ceremonies in our lives. It symbolizes the birth and creation of a new family. In this paper, we present a system for automatically segmenting ...
Wen-Huang Cheng, Yung-Yu Chuang, Yin-Tzu Lin, Chi-...
SCN
2004
Springer
14 years 27 days ago
Identity-Based Zero Knowledge
Abstract. We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely...
Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin
COCOON
1999
Springer
13 years 12 months ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman