45 search results - page 2 / 9 » On the communication and streaming complexity of maximum bip... |
SIBGRAPI
2007
IEEE
13 years 11 months ago
2007
IEEE
Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the ma...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
GLOBECOM
2008
IEEE
13 years 6 months ago
2008
IEEE
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
AICT
2005
IEEE
13 years 11 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...