874 search results - page 103 / 175 » Faster Algorithms for Semi-Matching Problems |
122
click to vote
ICOIN
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
120
click to vote
KDD
2005
ACM
16 years 1 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
102
Voted
ICDT
2010
ACM
15 years 16 days ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
219
click to vote
SASP
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
124
click to vote
SIAMCOMP
1998
15 years 1 months ago
1998
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...