Sciweavers

1068 search results - page 87 / 214
» Factorization as a Rank 1 Problem
Sort
View
TIP
2010
154views more  TIP 2010»
14 years 8 months ago
Projective Nonnegative Graph Embedding
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
Xiaobai Liu, Shuicheng Yan, Hai Jin
FOCS
2004
IEEE
15 years 1 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
DM
2007
97views more  DM 2007»
14 years 10 months ago
L(p, q) labeling of d-dimensional grids
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
Guillaume Fertin, André Raspaud
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
14 years 11 months ago
Precision, local search and unimodal functions
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
DCOSS
2007
Springer
15 years 1 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev