4117 search results - page 189 / 824 » On the Satisfiability of Complex Constraints |
145
click to vote
EMNLP
2008
15 years 8 months ago
2008
We improve the quality of paraphrases extracted from parallel corpora by requiring that phrases and their paraphrases be the same syntactic type. This is achieved by parsing the E...
209
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract-- We study joint rate control and resource allocation with QoS provisioning that maximizes the total utility of secondary users in cognitive radio networks. We formulate a...
223
click to vote
OL
2011
15 years 1 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
154
click to vote
GLOBECOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...
183
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...