642 search results - page 128 / 129 » Approximation Algorithms for Minimum K-Cut |
82
Voted
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—With recent advances in optical technology, we are closer to building all-optical routers than ever before. A major problem in this area, however, is the lack of all-optical mem...
111
click to vote
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—Continuous growth in network link rates poses a strong demand on high speed IP lookup engines. While Ternary Content Addressable Memory (TCAM) based solutions serve most of toda...
80
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
COCO
2003
Springer
15 years 2 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...