Sciweavers

21984 search results - page 612 / 4397
» C
Sort
View
156
Voted
CCR
2007
126views more  CCR 2007»
15 years 7 months ago
DVB: from broadcasting to ip delivery
This paper gives a brief overview of the Digital Video Broadcasting (DVB) project. Starting in 1993, this project produced standards for digital broadcasting in all media (satelli...
Helmut Bürklin, Ralf Schäfer, Dietrich W...
219
Voted
NETWORKS
2008
15 years 7 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
4OR
2005
158views more  4OR 2005»
15 years 7 months ago
Bilevel programming: A survey
This paper provides an introductory survey of a class of optimization problems known as bilevel programming. We motivate this class through a simple application, and then proceed w...
Benoît Colson, Patrice Marcotte, Gilles Sava...
236
Voted
WWW
2008
ACM
16 years 8 months ago
As we may perceive: finding the boundaries of compound documents on the web
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
Pavel Dmitriev
183
Voted
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 11 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó