7228 search results - page 209 / 1446 » From Algorithmic to Subjective Randomness |
112
click to vote
ACL
2009
15 years 1 months ago
2009
It is usually assumed that the kind of noise existing in annotated data is random classification noise. Yet there is evidence that differences between annotators are not always ra...
125
Voted
IS
2010
15 years 2 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
121
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
170
click to vote
SIAMREV
2010
14 years 10 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
131
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
The problem of multiple sequence alignment is important for bioinformatics. This problem is widely studied and a popular tool to solve this problem is Clustal X. This work introdu...