4536 search results - page 383 / 908 » Contention-Sensitive Data Structures and Algorithms |
190
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
212
click to vote
AAAI
2007
15 years 9 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
197
click to vote
ICDM
2005
IEEE
16 years 13 days ago
2005
IEEE
In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-const...
172
click to vote
NAACL
2007
15 years 8 months ago
2007
Dependency analysis of natural language gives rise to non-projective structures. The constraint of well-nestedness on dependency trees has been recently shown to give a good fit ...
172
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...