Sciweavers

1887 search results - page 361 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 2 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
ICAIL
2007
ACM
13 years 11 months ago
Essential deduplication functions for transactional databases in law firms
As massive document repositories and knowledge management systems continue to expand, in proprietary environments as well as on the Web, the need for duplicate detection becomes i...
Jack G. Conrad, Edward L. Raymond
BMCBI
2010
101views more  BMCBI 2010»
13 years 7 months ago
Enrichment of homologs in insignificant BLAST hits by co-complex network alignment
Background: Homology is a crucial concept in comparative genomics. The algorithm probably most widely used for homology detection in comparative genomics, is BLAST. Usually a stri...
Like Fokkens, Sandra M. C. Botelho, Jos Boekhorst,...
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
14 years 8 months ago
A multi-relational approach to spatial classification
Spatial classification is the task of learning models to predict class labels based on the features of entities as well as the spatial relationships to other entities and their fe...
Richard Frank, Martin Ester, Arno Knobbe
IUI
2009
ACM
14 years 4 months ago
What were you thinking?: filling in missing dataflow through inference in learning from demonstration
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
Melinda T. Gervasio, Janet L. Murdock