425 search results - page 36 / 85 » Polynomial Time Data Reduction for Dominating Set |
CPM
2000
Springer
15 years 1 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...
INFOCOM
2011
IEEE
14 years 28 days ago
2011
IEEE
—To better support interactive applications, individual network operators are decreasing the timers that affect BGP convergence, leading to greater diversity in the timer setting...
BROADNETS
2006
IEEE
15 years 3 months ago
2006
IEEE
Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot mi...
95
Voted
PODS
2007
ACM
15 years 9 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
BMCBI
2008
14 years 9 months ago
2008
Background: The integration of biomedical information is essential for tackling medical problems. We describe a data model in the domain of flow cytometry (FC) allowing for massiv...