Sciweavers

417 search results - page 55 / 84
» Orderings for Innermost Termination
Sort
View
COLING
2010
13 years 2 months ago
Kernel Slicing: Scalable Online Training with Conjunctive Features
This paper proposes an efficient online method that trains a classifier with many conjunctive features. We employ kernel computation called kernel slicing, which explicitly consid...
Naoki Yoshinaga, Masaru Kitsuregawa
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
CPP
2011
107views more  CPP 2011»
12 years 7 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
PDP
2007
IEEE
14 years 1 months ago
Metadata Integration and Media Transcoding in Universal-Plug-and-Play (UPnP) Enabled Networks
Universal Plug and Play (UPnP) is a widely accepted standard for automatically detecting devices and services in a local area network as well as for describing and controlling the...
M. Jakab, Michael Kropfberger, M. Ofner, Roland Tu...
AGP
1994
IEEE
13 years 11 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari