4114 search results - page 561 / 823 » Efficient Algorithms for the 2-Center Problems |
171
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
177
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
161
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
174
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
164
click to vote
CPM
1998
Springer
15 years 11 months ago
1998
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...