Sciweavers

1941 search results - page 88 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 4 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
CCR
2007
85views more  CCR 2007»
14 years 10 months ago
Don't optimize existing protocols, design optimizable protocols
As networks grow in size and complexity, network management has become an increasingly challenging task. Many protocols have tunable parameters, and optimization is the process of...
Jiayue He, Jennifer Rexford, Mung Chiang
NDSS
2003
IEEE
15 years 3 months ago
Traps and Pitfalls: Practical Problems in System Call Interposition Based Security Tools
System call interposition is a powerful method for regulating and monitoring application behavior. In recent years, a wide variety of security tools have been developed that use t...
Tal Garfinkel
CIKM
2006
Springer
15 years 1 months ago
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
Mohamed Aly, Kirk Pruhs, Panos K. Chrysanthis
JCB
2006
115views more  JCB 2006»
14 years 10 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger