9949 search results - page 1598 / 1990 » On the Network Complexity of Selection |
191
click to vote
DCC
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we propose a chunkless structure for multimedia distribution over peer-to-peer networks. With the proposed approach, the original multimedia packets are partitioned ...
157
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
162
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Parallel Global Optimization Algorithms (PGOA) provide an efficient way of dealing with hard optimization problems. One method of parallelization of GOAs that is frequently applie...
171
click to vote
CN
2006
15 years 7 months ago
2006
Though Connection Admission Control (CAC) in wireless networks has been studied extensively, the heterogeneous structure of Next Generation Wireless Systems (NGWS) makes CAC very ...
188
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...