Sciweavers

567 search results - page 113 / 114
» Similarity Search Using Multiple Examples in MARS
Sort
View
AAAI
1990
13 years 6 months ago
The Design of a Marker Passing Architecture for Knowledge Processing
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
Wing Lee, Dan I. Moldovan
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 5 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
CCGRID
2003
IEEE
13 years 11 months ago
A Parallel FPT Application For Clusters
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
James Cheetham, Frank K. H. A. Dehne, Andrew Rau-C...
BMCBI
2006
129views more  BMCBI 2006»
13 years 5 months ago
BIPAD: A web server for modeling bipartite sequence elements
Background: Many dimeric protein complexes bind cooperatively to families of bipartite nucleic acid sequence elements, which consist of pairs of conserved half-site sequences sepa...
Chengpeng Bi, Peter K. Rogan
SIGIR
2012
ACM
11 years 8 months ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel