2018 search results - page 88 / 404 » Magnitude-preserving ranking algorithms |
164
click to vote
BPM
2009
Springer
16 years 23 days ago
2009
Springer
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
139
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
181
click to vote
JMLR
2012
13 years 8 months ago
2012
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
161
click to vote
UAI
2008
15 years 7 months ago
2008
We introduce a new type of graphical model called a `cumulative distribution network' (CDN), which expresses a joint cumulative distribution as a product of local functions. ...
185
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...