2593 search results - page 445 / 519 » Algorithms and Data Structures for Computer Topology |
HIPC
2007
Springer
14 years 23 days 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...
CPM
2004
Springer
14 years 19 days 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...
ENC
2006
IEEE
14 years 17 days 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...
DSN
2008
IEEE
13 years 10 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...
PR
2010
13 years 3 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...