14739 search results - page 352 / 2948 » An optimization problem on the sphere |
181
click to vote
ICALP
1998
Springer
15 years 11 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
177
click to vote
HICSS
1994
IEEE
15 years 11 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
203
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
197
click to vote
COCOON
2010
Springer
15 years 10 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
158
click to vote
CVPR
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper presents a multi-frame data association algorithm for tracking multiple targets in video sequences. Multi-frame data association involves finding the most probable corr...