Sciweavers

2657 search results - page 50 / 532
» On the complexity of hierarchical problem solving
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 2 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
WWW
2008
ACM
16 years 2 months ago
Enhanced hierarchical classification via isotonic smoothing
Hierarchical topic taxonomies have proliferated on the World Wide Web [5, 18], and exploiting the output space decompositions they induce in automated classification systems is an...
Kunal Punera, Joydeep Ghosh
INFOCOM
2008
IEEE
15 years 7 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
GPC
2007
Springer
15 years 7 months ago
Optimizing Server Placement for QoS Requirements in Hierarchical Grid Environments
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network...
Chien-Min Wang, Chun-Chen Hsu, Pangfeng Liu, Hsi-M...
RTAS
2005
IEEE
15 years 7 months ago
Scalable QoS-Based Resource Allocation in Hierarchical Networked Environment
In this paper, we study the problem of allocating end-toend bandwidth to each of multiple traffic flows in a largescale network. We adopt the QoS-based Resource Allocation Model...
Sourav Ghosh, Ragunathan Rajkumar, Jeffery P. Hans...