9842 search results - page 356 / 1969 » The Complexity of the Matching-Cut Problem |
108
click to vote
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...
146
click to vote
PAMI
2010
15 years 2 months ago
2010
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
160
click to vote
SIAMDM
2010
15 years 2 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
149
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
135
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...