1299 search results - page 90 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
EURODAC
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper presents a novel approach to scheduling of hardware supported synchronization operations. The optimization goal is to minimize the interation time of processes and thus...
96
Voted
MOBISYS
2008
ACM
15 years 9 months ago
2008
ACM
Mobile phones have the potential to be useful agents for their owners by detecting and reporting situations that are of interest. Several challenges emerge in the case of detectin...
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...