14158 search results - page 282 / 2832 » Generalized switch-setting problems |
145
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
137
click to vote
ECCV
2006
Springer
15 years 7 months ago
2006
Springer
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
138
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
125
click to vote
ECIS
2001
15 years 5 months ago
2001
The authors describe on going research to uncover the architectonic nature of artefacts and see how these may be related to high-level, but also grounded, model of the original pr...
146
click to vote
IJCAI
2001
15 years 5 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...