780 search results - page 64 / 156 » Cost-Sharing Approximations for h |
IJON
2007
14 years 11 months ago
2007
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...
BC
1998
14 years 11 months ago
1998
In homing tasks, the goal is often not marked by visible objects but must be inferred from the spatial relation to the visual cues in the surrounding scene. The exact computation o...
PVLDB
2010
14 years 9 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
107
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...