2924 search results - page 407 / 585 » Lower Bounds in Distributed Computing |
150
click to vote
JCT
2011
14 years 12 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
124
click to vote
SIAMREV
2011
14 years 7 months ago
2011
We propose a mathematical model for an infestation of a wooded area by a beetle species in which the larvae develop deep in the wood of living trees. Due to the difficulties of det...
166
click to vote
JMLR
2012
13 years 7 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
136
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
145
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...