9842 search results - page 1701 / 1969 » The Complexity of the Matching-Cut Problem |
155
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
140
click to vote
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
161
click to vote
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
155
click to vote
EUROSYS
2010
ACM
16 years 1 months ago
2010
ACM
The benefits of virtualized IT environments, such as compute clouds, have drawn interested enterprises to migrate their applications onto new platforms to gain the advantages of ...
147
click to vote
ICCD
2006
IEEE
16 years 1 months ago
2006
IEEE
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...