42230 search results - page 91 / 8446 » Algorithms and Complexity Results for |
FCT
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
Conventional stereoscopic video content production requires use of dedicated stereo camera rigs which is both costly and lacking video editing flexibility. In this paper, we propo...
110
click to vote
PODC
2012
ACM
13 years 7 days ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
109
click to vote
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...