604 search results - page 64 / 121 » On the Complexity of the Maximum Cut Problem |
TVCG
2010
14 years 8 months ago
2010
—This paper presents the first practical method for “origamizing” or obtaining the folding pattern that folds a single sheet of material into a given polyhedral surface with...
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
In the last few years, several algorithms for the automatic alignment of audio and score data corresponding to the same piece of music have been proposed. Among the major drawback...
108
click to vote
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...