Sciweavers

962 search results - page 81 / 193
» Some Reducibilities on Regular Sets
Sort
View
CONCUR
2007
Springer
14 years 2 months ago
Checking Coverage for Infinite Collections of Timed Scenarios
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
S. Akshay, Madhavan Mukund, K. Narayan Kumar
CSB
2004
IEEE
126views Bioinformatics» more  CSB 2004»
14 years 1 months ago
Boosted PRIM with Application to Searching for Oncogenic Pathway of Lung Cancer
Boosted PRIM (Patient Rule Induction Method) is a new algorithm developed for two-class classification problems. PRIM is a variation of those Tree-Based methods ( [4] Ch9.3), seek...
Pei Wang, Young Kim, Jonathan R. Pollack, Robert T...
DOOD
1995
Springer
124views Database» more  DOOD 1995»
14 years 1 months ago
Querying Semistructured Heterogeneous Information
Abstract. Semistructured data has no absolute schema xed in advance and its structure may be irregular or incomplete. Such data commonly arises in sources that do not impose a rigi...
Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jef...
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 10 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
DM
2008
97views more  DM 2008»
13 years 10 months ago
(r, r+1)-factorizations of (d, d+1)-graphs
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...
Anthony J. W. Hilton