2297 search results - page 312 / 460 » A fast APRIORI implementation |
234
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
266
click to vote
Publication
The available bit rate (ABR) service is proposed to transport data traffic in asynchronous transfer mode (ATM) networks. ABR is unique because the network switches can indicate to ...
217
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
184
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Common visual codebook generation methods used in
a Bag of Visual words model, e.g. k-means or Gaussian
Mixture Model, use the Euclidean distance to cluster features
into visual...
189
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...