1963 search results - page 273 / 393 » The Maximum Solution Problem on Graphs |
CVPR
2000
IEEE
15 years 5 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
158
click to vote
ESA
2011
Springer
14 years 12 days ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
79
Voted
KDD
2005
ACM
16 years 1 months ago
2005
ACM
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
188
click to vote
VLDB
2008
ACM
16 years 27 days ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
123
click to vote
KDD
2005
ACM
15 years 6 months ago
2005
ACM
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...