Sciweavers

121 search results - page 5 / 25
» Visibility Representations of Complete Graphs
Sort
View
CONCUR
2000
Springer
13 years 11 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
ICASSP
2011
IEEE
12 years 11 months ago
Optical MEMS image enhancement with sparse signal representation
This paper describes a complete low-complexity imaging system based on a single MEMS scanning mirror and a single photodetector, together with customized image enhancement algorit...
Ganchi Zhang, Li Li, Vladimir Stankovic, Lina Stan...
JOT
2010
173views more  JOT 2010»
13 years 5 months ago
A Dependence Representation for Coverage Testing of Object-Oriented Programs
Abstract We propose a dependence-based representation for object-oriented programs, named Call-based Object-Oriented System Dependence Graph (COSDG). Apart from structural features...
E. S. F. Najumudheen, Rajib Mall, Debasis Samanta
BMCBI
2008
116views more  BMCBI 2008»
13 years 7 months ago
A novel representation of RNA secondary structure based on element-contact graphs
Background: Depending on their specific structures, noncoding RNAs (ncRNAs) play important roles in many biological processes. Interest in developing new topological indices based...
Wenjie Shu, Xiaochen Bo, Zhiqiang Zheng, Shengqi W...
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart