5962 search results - page 1060 / 1193 » Efficient Clustering for Orders |
188
click to vote
KDD
2005
ACM
15 years 12 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...
178
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
150
click to vote
DMKD
2004
ACM
15 years 12 months ago
2004
ACM
Record linkage, the problem of determining when two records refer to the same entity, has applications for both data cleaning (deduplication) and for integrating data from multipl...
164
click to vote
ILP
2004
Springer
15 years 11 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
217
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...