874 search results - page 90 / 175 » Faster Algorithms for Semi-Matching Problems |
SCVMA
2004
Springer
15 years 3 months ago
2004
Springer
This paper deals with the motion detection problem. This issue is of key importance in many application fields. To solve this problem, we compute the dominant motion in the sequen...
COCOON
1999
Springer
15 years 2 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
MOC
2000
14 years 9 months ago
2000
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
FSTTCS
2007
Springer
15 years 4 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...