1964 search results - page 277 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
111
click to vote
INFOCOM
1993
IEEE
15 years 6 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
FOSSACS
2006
Springer
15 years 6 months ago
2006
Springer
Some recent Petri net-based approaches to fault diagnosis of distributed systems suggest to factor the problem into local diagnoses based on the unfoldings of local views of the sy...
105
Voted
ADBIS
2008
Springer
15 years 4 months ago
2008
Springer
In many problems the raw data is already classified according to a variety of features using some linear classification algorithm but needs to be reclassified. We introduce a novel...
106
click to vote
ECIR
2007
Springer
15 years 3 months ago
2007
Springer
The amount of data exponentially increases in information systems and it becomes more and more difficult to extract the most relevant information within a very short time. Among ot...
120
click to vote
NA
2008
15 years 2 months ago
2008
In this paper, we propose a segmentation method based on the Generalized Fast Marching Method (GFMM) developed by Carlini et al.([6]). The classical Fast Marching Method (FMM) is a...