2780 search results - page 106 / 556 » Generalizing by Removing Detail |
119
click to vote
IMAGING
2004
15 years 6 months ago
2004
In this study, the problem of updating a printer characterization in response to systematic changes in print-device characteristics is addressed with two distinct approaches: the ...
130
click to vote
SIGCOMM
2010
ACM
15 years 4 months ago
2010
ACM
Traditionally, in-network services like firewall, proxy, cache, and transcoders have been provided by dedicated hardware middleboxes. A recent trend has been to remove the middleb...
104
click to vote
DAM
2010
15 years 4 months ago
2010
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...
130
click to vote
DAM
2008
15 years 4 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
126
click to vote
DM
2008
15 years 4 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...