377 search results - page 72 / 76 » Getting to the Point... |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
EJC
2010
13 years 8 months ago
2010
We start by describing all the varieties of loops Q that can be defined by autotopisms x, x Q, where x is a composition of two triples, each of which becomes an autotopism when th...
AI
2006
Springer
13 years 8 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
BMCBI
2006
13 years 8 months ago
2006
Background: Microarrays used for gene expression studies yield large amounts of data. The processing of such data typically leads to lists of differentially-regulated genes. A com...
CAD
2006
Springer
13 years 8 months ago
2006
Springer
A large amount of 2D drawings have been produced in engineering fields. To reuse and share the available drawings efficiently, we propose two methods in this paper, namely 2.5D sp...