Sciweavers

1963 search results - page 106 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
SERP
2010
15 years 1 months ago
Towards Automatic Integration of Or-BAC Security Policies Using Aspects
We propose a formal method to automatically integrate security rules regarding an access control policy (expressed in Or-BAC) in Java programs. Given an untrusted application and a...
Yliès Falcone, Mohamad Jaber
ICALP
1995
Springer
15 years 6 months ago
Weakly Useful Sequences
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo
4OR
2006
100views more  4OR 2006»
15 years 3 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
APPT
2005
Springer
15 years 8 months ago
Principal Component Analysis for Distributed Data Sets with Updating
Identifying the patterns of large data sets is a key requirement in data mining. A powerful technique for this purpose is the principal component analysis (PCA). PCA-based clusteri...
Zheng-Jian Bai, Raymond H. Chan, Franklin T. Luk
TJS
2002
83views more  TJS 2002»
15 years 2 months ago
An I/O-Conscious Tiling Strategy for Disk-Resident Data Sets
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Due ...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...