130 search results - page 18 / 26 » Algorithms for Finding a Most Similar Subforest |
WAW
2010
Springer
14 years 7 months ago
2010
Springer
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
116
click to vote
KSEM
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Ontology mapping is one of the most important tasks for ontology interoperability and its main aim is to find semantic relationships between entities (i.e. concept, attri...
175
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
PRL
2008
14 years 9 months ago
2008
(204 words) We have developed a novel method to derive scale information from quasi-stationary images, which relies on a rotation-guided multi-scale analysis of features derived fr...