Sciweavers

724 search results - page 106 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
COMCOM
2008
103views more  COMCOM 2008»
15 years 3 months ago
Fast reroute with pre-established bypass tunnel in MPLS
Internet IP networks utilize multiple-protocol label switching (MPLS), which provides a reliable label switched path (LSP). LSP in MPLS domains needs one label at each Ingress lab...
Wei Kuang Lai, Zhen Chang Zheng, Chen-Da Tsai
ICDE
2008
IEEE
110views Database» more  ICDE 2008»
16 years 4 months ago
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
Muhammed Miah, Gautam Das, Vagelis Hristidis, Heik...
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 3 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
TPDS
2008
92views more  TPDS 2008»
15 years 3 months ago
Max-Min Fair Scheduling in Input-Queued Switches
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
Madhusudan Hosaagrahara, Harish Sethu
103
Voted
INFOCOM
2002
IEEE
15 years 8 months ago
Guaranteed Scheduling for Switches with Configuration Overhead
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
Brian Towles, William J. Dally