2745 search results - page 123 / 549 » A fast algorithm for computing large Fibonacci numbers |
140
click to vote
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays an...
139
click to vote
PG
2002
IEEE
15 years 8 months ago
2002
IEEE
A novel and fast shape classification and regularization algorithm for on-line sketchy graphics recognition is proposed. We divided the on-line graphics recognition process into f...
114
Voted
GD
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
112
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a seed-based algorithm for intensive DNA sequence comparison. The novelty comes from the way seeds are used to efficiently generate small ungapped alignments ...
139
click to vote
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...