2450 search results - page 27 / 490 » Time Mapping with Hypergraphs |
116
click to vote
STOC
2010
ACM
15 years 1 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
63
Voted
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
IPL
2000
14 years 9 months ago
2000
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
VTC
2008
IEEE
15 years 4 months ago
2008
IEEE
—Orthogonal frequency division multiplexing (OFDM) signals have a problem with high peak-to-average power ratio (PAPR). A distortionless selective mapping (SLM) has been proposed...