706 search results - page 81 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
CCGRID
2004
IEEE
14 years 19 days ago
2004
IEEE
Distributed Hash Tables (DHTs) bring the promise of increased availability of data to wide-area systems, under the assumption of uniform request load. However, they don't int...
ANCS
2008
ACM
13 years 11 months ago
2008
ACM
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
INFOCOM
1993
IEEE
14 years 1 months ago
1993
IEEE
Over the last decade Internet has grown by orders of magnitude in size. Many of the protocols that were designed several years ago are still in use. It is not clear if the assumpt...
ICMLA
2009
13 years 6 months ago
2009
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
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...