1300 search results - page 219 / 260 » Constraint satisfaction problems and global cardinality cons... |
150
click to vote
ICC
2007
IEEE
16 years 13 days ago
2007
IEEE
We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter is...
190
click to vote
FOCS
2008
IEEE
16 years 17 days ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
185
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
163
click to vote
CP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
155
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents a robust method to solve the two coupled problems: ground layer detection and vehicle egomotion estimation, which appear in visual navigation. We virtually rot...