33 search results - page 6 / 7 » The Minimum Consistent DFA Problem Cannot Be Approximated wi... |
PVLDB
2010
13 years 4 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
AAIM
2009
Springer
14 years 12 days ago
2009
Springer
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
IPL
2010
13 years 18 days ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
GLOBECOM
2009
IEEE
14 years 16 days 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...