913 search results - page 70 / 183 » New polytopes from products |
173
click to vote
FOCS
2004
IEEE
15 years 10 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 ...
170
click to vote
ICINCO
2004
15 years 7 months ago
2004
: The automation manufacturing business has reached its turning point and manufacturers are forced to create new business areas. Their expertise about field devices will be the sou...
162
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
162
click to vote
CSCW
2000
ACM
15 years 6 months ago
2000
ACM
This paper asks the question: how might CSCW system design obtain and be informed by an adequate real-world, real-time understanding of work and organisation on any occasion of wor...
176
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...