3204 search results - page 488 / 641 » The b-chromatic Number of a Graph |
207
click to vote
PAAPP
2000
15 years 6 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
193
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
178
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
209
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
192
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...