7106 search results - page 164 / 1422 » Restricted Complexity, General Complexity |
140
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
158
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
137
Voted
DOCENG
2003
ACM
15 years 8 months ago
2003
ACM
This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an a...
169
Voted
MM
2003
ACM
15 years 8 months ago
2003
ACM
This paper proposes a novel method for detection and segmentation of foreground objects from a video which contains both stationary and moving background objects and undergoes bot...
150
Voted
EWSPT
2001
Springer
15 years 8 months ago
2001
Springer
We describe an approach based upon software process technology to on-the-fly monitoring, redeployment, reconfiguration, and in general dynamic adaptation of distributed software ap...