601 search results - page 71 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
189
click to vote
FOCS
2008
IEEE
16 years 16 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:...
171
click to vote
NHM
2010
15 years 25 days ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
185
click to vote
FOCS
2009
IEEE
16 years 24 days ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
174
click to vote
PRDC
2007
IEEE
16 years 10 days ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
176
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, ma...