3874 search results - page 632 / 775 » Approximation Algorithms for k-hurdle Problems |
140
click to vote
CIAC
2000
Springer
15 years 8 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
116
Voted
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
148
click to vote
CVPR
2001
IEEE
16 years 6 months ago
2001
IEEE
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
133
Voted
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...
206
Voted
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
In the publish/subscribe paradigm, information providers disseminate publications to all consumers who have expressed interest by registering subscriptions. This paradigm has foun...