Sciweavers

1743 search results - page 338 / 349
» Generalized Modal Satisfiability
Sort
View
CORR
2007
Springer
97views Education» more  CORR 2007»
13 years 9 months ago
Side-information Scalable Source Coding
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
Chao Tian, Suhas N. Diggavi
JOT
2008
108views more  JOT 2008»
13 years 9 months ago
Requirements analysis for large scale systems
All readers of this paper most likely have knowledge of the software requirements discipline and of the use case notation, however not everyone is aware that with the progress of ...
Roger Johnson, George Roussos, Luca Vetti Tagliati
JSAT
2008
122views more  JSAT 2008»
13 years 9 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
EAAI
2007
93views more  EAAI 2007»
13 years 9 months ago
Mining Pareto-optimal rules with respect to support and confirmation or support and anti-support
: In knowledge discovery and data mining many measures of interestingness have been proposed in order to measure the relevance and utility of the discovered patterns. Among these m...
Izabela Brzezinska, Salvatore Greco, Roman Slowins...
ECCC
2007
124views more  ECCC 2007»
13 years 9 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler