369 search results - page 52 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
71
Voted
APIN
2010
14 years 12 months ago
2010
The original Parameter-Less Self-Organising Map (PLSOM) algorithm was introduced as a solution to the problems the Self-Organising Map (SOM) encounters when dealing with certain ty...
104
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
101
click to vote
ALENEX
2009
14 years 9 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
110
click to vote
EMNLP
2011
13 years 11 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...