Sciweavers

1532 search results - page 257 / 307
» Connection Relations in Mereotopology
Sort
View
JAIR
2007
95views more  JAIR 2007»
13 years 9 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson
JAT
2007
55views more  JAT 2007»
13 years 9 months ago
Chalmers-Metcalf operator and uniqueness of minimal projections
We know that not all minimal projections in Lp (1 < p < ∞) are unique (see [39]). The aim of this paper is examine the connection of the Chalmers-Metcalf operator (introduc...
Grzegorz Lewicki, Leslaw Skrzypek
JCB
2007
108views more  JCB 2007»
13 years 9 months ago
A Dynamic Programming Approach for Finding Common Patterns in RNAs
We developed a dynamic programming approach of computing common sequence structure patterns among two RNAs given their primary sequences and their secondary structures. Common pat...
Sven Siebert, Rolf Backofen
JIPS
2007
100views more  JIPS 2007»
13 years 9 months ago
Static Type Assignment for SSA Form in CTOC
: Although the Java bytecode has numerous advantages, it also has certain shortcomings such as its slow execution speed and difficulty of analysis. In order to overcome such disadv...
Ki-Tae Kim, Weon-Hee Yoo
JSAC
2007
95views more  JSAC 2007»
13 years 9 months ago
Experiences in implementing an experimental wide-area GMPLS network
In this article, we describe our experiences in implementing an experimental wide-area GMPLS network called CHEETAH (Circuit-Switched End-to-End Transport Architecture). The key c...
Xiangfei Zhu, Xuan Zheng, Malathi Veeraraghavan