16404 search results - page 222 / 3281 » A set coverage problem |
121
click to vote
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
130
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
141
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. We address the problem of comparing sets of images for object recognition, where the sets may represent arbitrary variations in an object's appearance due to changin...
127
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
108
Voted
CORR
2004
Springer
15 years 4 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...