539 search results - page 92 / 108 » Recurrence relations and fast algorithms |
CIAC
2000
Springer
15 years 4 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
KDD
2001
ACM
16 years 3 days ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
127
click to vote
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
110
click to vote
MM
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we study how a sensor-rich world can be exploited by digital recording devices such as cameras and camcorders to improve a user’s ability to search through a larg...
BMCBI
2008
14 years 12 months ago
2008
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...