Sciweavers

157 search results - page 20 / 32
» A Simple Algorithm for Finding Exact Common Repeats
Sort
View
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 4 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
13 years 10 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
AAAI
2000
13 years 8 months ago
PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment
Researchers in the ontology-design field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web ...
Natalya Fridman Noy, Mark A. Musen
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 6 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
BMCBI
2006
142views more  BMCBI 2006»
13 years 6 months ago
Improving the Performance of SVM-RFE to Select Genes in Microarray Data
Background: Recursive Feature Elimination is a common and well-studied method for reducing the number of attributes used for further analysis or development of prediction models. ...
Yuanyuan Ding, Dawn Wilkins