Sciweavers

20 search results - page 2 / 4
» Representations of directed strongly regular graphs
Sort
View
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 5 months ago
Graph-Based Classification of Self-Dual Additive Codes over Finite Fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
Lars Eirik Danielsen
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
13 years 9 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
AAAI
2008
13 years 7 months ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang
ICIP
2006
IEEE
14 years 7 months ago
Low-Rate Reduced Complexity Image Compression using Directionlets
The standard separable two-dimensional (2-D) wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth...
Vladan Velisavljevic, Baltasar Beferull-Lozano, Ma...
ICSE
2008
IEEE-ACM
14 years 5 months ago
CCVisu: automatic visual software decomposition
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
Dirk Beyer