Sciweavers

4095 search results - page 314 / 819
» How to test a tree
Sort
View
121
Voted
EVOW
2004
Springer
15 years 6 months ago
Two-Step Genetic Programming for Optimization of RNA Common-Structure
We present an algorithm for identifying putative non-coding RNA (ncRNA) using an RCSG (RNA Common-Structural Grammar) and show the effectiveness of the algorithm. The algorithm con...
Jin-Wu Nam, Je-Gun Joung, Y. S. Ahn, Byoung-Tak Zh...
123
Voted
ICWE
2004
Springer
15 years 6 months ago
Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining
Data mining includes four steps: data preparation, pattern mining, and pattern analysis and pattern application. But in web environment, the user activities become much more comple...
Long Wang 0002, Christoph Meinel
155
Voted
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 5 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
87
Voted
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 5 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
87
Voted
ICNP
1998
IEEE
15 years 5 months ago
Maximizable Routing Metrics
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...
Mohamed G. Gouda, Marco Schneider