4131 search results - page 271 / 827 » The Generalized Max-Controlled Set Problem |
145
click to vote
ALENEX
2009
15 years 5 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
139
click to vote
ICML
1998
IEEE
16 years 5 months ago
1998
IEEE
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
135
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
130
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
180
click to vote
VLDB
2000
ACM
15 years 8 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...