Sciweavers

29908 search results - page 5837 / 5982
» On the complexity of communication complexity
Sort
View
TON
2008
119views more  TON 2008»
15 years 6 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
TPDS
2008
124views more  TPDS 2008»
15 years 6 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
TPDS
2008
140views more  TPDS 2008»
15 years 6 months ago
High-Performance Resource Allocation and Request Redirection Algorithms for Web Clusters
Abstract-- With increasing richness in features such as personalization of content, web applications are becoming more complex and hence compute intensive. Traditional approaches t...
Supranamaya Ranjan, Edward W. Knightly
CGF
2005
204views more  CGF 2005»
15 years 6 months ago
BRDF and geometry capture from extended inhomogeneous samples using flash photography
We present a technique which allows capture of 3D surface geometry and a useful class of BRDFs using extremely simple equipment. A standard digital camera with an attached flash s...
James A. Paterson, David Claus, Andrew W. Fitzgibb...
CGF
2005
107views more  CGF 2005»
15 years 6 months ago
Predictive Feedback for Interactive Control of Physics-based Characters
Interactive control of a physically simulated character is a challenging problem, due both to the complexity of controlling multiple degrees of freedom with lower dimensional inpu...
Joe Laszlo, Michael Neff, Karan Singh
« Prev « First page 5837 / 5982 Last » Next »