4131 search results - page 170 / 827 » The Generalized Max-Controlled Set Problem |
235
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
122
Voted
CJ
2008
15 years 3 months ago
2008
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
153
Voted
KDD
2012
ACM
13 years 6 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
153
Voted
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
137
Voted
IAT
2005
IEEE
15 years 9 months ago
2005
IEEE
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...