3780 search results - page 120 / 756 » Algorithms for Game Metrics |
109
Voted
CCCG
2007
15 years 2 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
99
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
101
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
107
click to vote
ICCAD
2003
IEEE
15 years 9 months ago
2003
IEEE
Emerging VLSI technologies and platforms are giving rise to systems with inherently high potential for runtime failure. Such failures range from intermittent electrical and mechan...
115
click to vote
TACAS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract In the event that a system does not satisfy a specification, a model checker will typically automatically produce a counterexample trace that shows a particular instance ...