Sciweavers

2414 search results - page 125 / 483
» Computing Normal Subgroups
Sort
View
CIE
2007
Springer
14 years 3 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
EDBT
2000
ACM
14 years 20 days ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 9 months ago
Selection, combination, and evaluation of effective software sensors for detecting abnormal computer usage
We present and empirically analyze a machine-learning approach for detecting intrusions on individual computers. Our Winnowbased algorithm continually monitors user and system beh...
Jude W. Shavlik, Mark Shavlik
SOSP
2003
ACM
14 years 6 months ago
Terra: a virtual machine-based platform for trusted computing
We present a flexible architecture for trusted computing, called Terra, that allows applications with a wide range of security requirements to run simultaneously on commodity har...
Tal Garfinkel, Ben Pfaff, Jim Chow, Mendel Rosenbl...
DATE
2006
IEEE
171views Hardware» more  DATE 2006»
14 years 3 months ago
Dynamic bit-width adaptation in DCT: image quality versus computation energy trade-off
We present a dynamic bit-width adaptation scheme in DCT applications for efficient trade-off between image quality and computation energy. Based on sensitivity differences of 64 ...
Jongsun Park, Jung Hwan Choi, Kaushik Roy