Sciweavers

279 search results - page 54 / 56
» Type-II Optimal Polynomial Bases
Sort
View
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 6 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
14 years 3 months ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
FOCS
2006
IEEE
14 years 2 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
BROADNETS
2005
IEEE
14 years 2 months ago
Dual-link failure resiliency through backup link mutual exclusion
— Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternative...
Amit Chandak, Srinivasan Ramasubramanian
MM
1997
ACM
97views Multimedia» more  MM 1997»
14 years 26 days ago
A Failure and Overload Tolerance Mechanism for Continuous Media Servers
–Large scale clustered continuous media (CM) servers deployed in applications like video-on-demand have high availability requirements. In the event of server failure, streams fr...
Rajesh Krishnan, Dinesh Venkatesh, Thomas D. C. Li...