Sciweavers

331 search results - page 45 / 67
» Approximation Algorithms for Connected Dominating Sets
Sort
View
INFOCOM
2003
IEEE
15 years 5 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
83
Voted
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 1 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
ALT
2010
Springer
15 years 1 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
MICCAI
2002
Springer
16 years 19 days ago
Line Integral Convolution for Visualization of Fiber Tract Maps from DTI
Abstract. Diffusion tensor imaging (DTI) can provide the fundamental information required for viewing structural connectivity. However, robust and accurate acquisition and processi...
Tim McGraw, Baba C. Vemuri, Zhizhou Wang, Yunmei C...
CISS
2008
IEEE
15 years 6 months ago
Progress on pricing with peering
—This paper examines a simple model of how a provider ISP charges customer ISPs by assuming the provider ISP wants to maximize its revenue when customer ISPs have the possibility...
Eui-woong Lee, David Buchfuhrer, Lachlan L. H. And...