6693 search results - page 939 / 1339 » Methods of Automatic Algorithm Generation |
122
click to vote
MP
2008
15 years 4 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
142
click to vote
TROB
2008
15 years 4 months ago
2008
Sampling-based nonholonomic and kinodynamic planning iteratively constructs solutions with sampled controls. A constructed trajectory is returned as an acceptable solution if its &...
129
click to vote
MVA
2002
15 years 4 months ago
2002
This paper proposes a novel approach to constituting all the feasible ways of folding, based on crease infomation obtained from an image of illustrations of general origami drill ...
137
click to vote
PAMI
2010
15 years 2 months ago
2010
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
163
click to vote
ICIG
2009
IEEE
15 years 2 months ago
2009
IEEE
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...