Sciweavers

555 search results - page 51 / 111
» Decompositions of Grammar Constraints
Sort
View
ISLPED
2004
ACM
151views Hardware» more  ISLPED 2004»
15 years 11 months ago
Dynamic voltage and frequency scaling based on workload decomposition
This paper presents a technique called “workload decomposition” in which the CPU workload is decomposed in two parts: on-chip and off-chip. The on-chip workload signifies the ...
Kihwan Choi, Ramakrishna Soma, Massoud Pedram
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 6 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ALT
2006
Springer
15 years 10 months ago
Learning and Extending Sublanguages
A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a par...
Sanjay Jain, Efim B. Kinber
TAICPART
2010
IEEE
166views Education» more  TAICPART 2010»
15 years 4 months ago
Linguistic Security Testing for Text Communication Protocols
We introduce a new Syntax-based Security Testing (SST) framework that uses a protocol specification to perform security testing on text-based communication protocols. A protocol sp...
Ben W. Y. Kam, Thomas R. Dean
CP
2004
Springer
15 years 11 months ago
Disjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...
Christian Bessière, Emmanuel Hebrard, Brahi...