Sciweavers

543 search results - page 27 / 109
» Argumentation Using Temporal Knowledge
Sort
View
CIDM
2007
IEEE
14 years 2 months ago
Structure Prediction in Temporal Networks using Frequent Subgraphs
— There are several types of processes which can be modeled explicitly by recording the interactions between a set of actors over time. In such applications, a common objective i...
Mayank Lahiri, Tanya Y. Berger-Wolf
CVPR
2004
IEEE
14 years 9 months ago
Selecting Ghosts and Queues from a Car Trackers Output Using a Spatio-Temporal Query Language
This paper presents a spatio-temporal query language useful for video interpretation and event recognition. The language is suited to describe configurations of objects moving on ...
Christian Köhler
ISMB
1993
13 years 9 months ago
Prediction of Primate Splice Junction Gene Sequences with a Cooperative Knowledge Acquisition System
Wepropose a cooperative conceptual modelling environment in which two agents interact : the machineand the humanexpert. Theformer is able to extract knowledge from data using a sy...
Engelbert Mephu Nguifo, Jean Sallantin
FOCS
2002
IEEE
14 years 20 days ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
EUROCRYPT
2006
Springer
13 years 11 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai