Sciweavers

2252 search results - page 178 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
BIRTHDAY
2009
Springer
15 years 11 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
COMCOM
1998
106views more  COMCOM 1998»
15 years 6 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
INFOCOM
2007
IEEE
16 years 1 months ago
Two-Tier Load Balancing in OSPF Wireless Back-Hauls
Abstract— High-speed wireless communication technology (e.g. WiMAX) makes it feasible and cost-effective to build wireless back-hauls for Internet access. Compared to wired count...
Xiaowen Zhang, Hao Zhu
199
Voted
COMPGEOM
2009
ACM
16 years 1 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
227
Voted
BCB
2010
150views Bioinformatics» more  BCB 2010»
15 years 2 months ago
Enzymatic target identification with dynamic states
As a metabolic network reaches from a state to a steady state, a subset of its fluxes gradually change. The sequence of intermediate states, called the dynamic state, shows the pa...
Bin Song, Sanjay Ranka, Tamer Kahveci