1299 search results - page 126 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
162
click to vote
VSTTE
2012
Springer
13 years 5 months ago
2012
Springer
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
RTCSA
2008
IEEE
15 years 4 months ago
2008
IEEE
Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-...