Sciweavers

611 search results - page 12 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
CIE
2005
Springer
14 years 1 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
MM
2003
ACM
79views Multimedia» more  MM 2003»
14 years 1 months ago
Hierarchical topical segmentation in instructional films based on cinematic expressive functions
In this paper, we propose a novel solution for segmenting an instructional video into hierarchical topical sections. Incorporating the knowledge of education-oriented film theory...
Dinh Q. Phung, Svetha Venkatesh, Chitra Dorai
VMCAI
2010
Springer
14 years 5 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
COLING
2002
13 years 7 months ago
An Indexing Scheme for Typed Feature Structures
This paper describes an indexing substrate for typed feature structures (ISTFS), which is an efficient retrieval engine for typed feature structures. Given a set of typed feature ...
Takashi Ninomiya, Takaki Makino, Jun-ichi Tsujii
CCS
2011
ACM
12 years 7 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta