2593 search results - page 445 / 519 » Algorithms and Data Structures for Computer Topology |
148
click to vote
HIPC
2007
Springer
15 years 6 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
123
click to vote
CPM
2004
Springer
15 years 6 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
118
Voted
ENC
2006
IEEE
15 years 6 months ago
2006
IEEE
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
132
click to vote
DSN
2008
IEEE
15 years 4 months ago
2008
IEEE
XOR-based erasure codes are a computationallyefficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets o...
139
click to vote
PR
2010
14 years 9 months ago
2010
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...