9842 search results - page 1586 / 1969 » The Complexity of the Matching-Cut Problem |
199
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
304
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
178
click to vote
ICCAD
2007
IEEE
16 years 3 months ago
2007
IEEE
Abstract— This paper addresses the module assignment problem in pinlimited designs under the stacked-Vdd circuit paradigm. A partition-based algorithm is presented for efficient...
175
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
181
click to vote
ICIW
2009
IEEE
16 years 1 months ago
2009
IEEE
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...