562 search results - page 72 / 113 » Dependency Pairs Revisited |
GD
2007
Springer
15 years 6 months ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
BIOCOMP
2007
15 years 1 months ago
2007
Background: Natural antisense transcripts (NATs) are coding or non-coding RNAs with sequence complementarity to other transcripts (sense transcripts). These RNAs could potentially...
DICTA
2003
15 years 1 months ago
2003
Abstract. This paper describes methods of extracting region boundaries from the frames of an image sequence by combining information from spatial or temporal cooccurrence matrices ...
WSC
2000
15 years 1 months ago
2000
STRACTION FOR DISCRETE EVENT SYSTEMS USING NEURAL NETWORKS AND SENSITIVITY INFORMATION Christos G. Panayiotou Christos G. Cassandras Department of Manufacturing Engineering Boston ...
101
click to vote
BMCBI
2010
14 years 12 months ago
2010
Background: With the rapid development of new genetic measurement methods, several types of genetic alterations can be quantified in a high-throughput manner. While the initial fo...