2745 search results - page 176 / 549 » A fast algorithm for computing large Fibonacci numbers |
154
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
145
click to vote
WECWIS
2002
IEEE
15 years 9 months ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
101
click to vote
DATE
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
141
click to vote
SIGMOD
1997
ACM
15 years 8 months ago
1997
ACM
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
136
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: The MEDLINE database contains over 12 million references to scientific literature, ut 3/4 of recent articles including an abstract of the publication. Retrieval of ent...