815 search results - page 63 / 163 » Approximate Entropy Reducts |
SIAMCOMP
2000
14 years 11 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
135
click to vote
WINE
2010
Springer
14 years 9 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
148
click to vote
JMLR
2010
14 years 6 months ago
2010
We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under...
122
click to vote
SIAMMAX
2011
14 years 2 months ago
2011
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
127
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...