Sciweavers

335 search results - page 31 / 67
» Compact Proofs of Retrievability
Sort
View
FUIN
2007
90views more  FUIN 2007»
13 years 7 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
ICIP
2003
IEEE
14 years 9 months ago
Face description based on decomposition and combining of a facial space with LDA
We propose a method of efficient face description for facial image retrieval from a large data set. The novel descriptor is obtained by decomposing the face image into several com...
Tae-Kyun Kim, Hyunwoo Kim, Wonjun Hwang, Seok-Cheo...
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
14 years 1 months ago
Semantic representation: search and mining of multimedia content
Semantic understanding of multimedia content is critical in enabling effective access to all forms of digital media data. By making large media repositories searchable, semantic ...
Apostol Natsev, Milind R. Naphade, John R. Smith
CCS
2006
ACM
13 years 11 months ago
Multi-signatures in the plain public-Key model and a general forking lemma
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. However, existing schemes impose key s...
Mihir Bellare, Gregory Neven
CLEIEJ
2006
88views more  CLEIEJ 2006»
13 years 7 months ago
A Stochastic Concurrent Constraint Based Framework to Model and Verify Biological Systems
Concurrent process calculi are powerful formalisms for modelling concurrent systems. The mathematical style underlying process calculi allow to both model and verify properties of...
Carlos Olarte, Camilo Rueda