1477 search results - page 218 / 296 » Random Convex Programs |
WINE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
IPSN
2004
Springer
14 years 1 months ago
2004
Springer
We describe a novel method for node localization in a sensor network where there are a fraction of reference nodes with known locations. For application-specific sensor networks, ...
CDC
2009
IEEE
14 years 13 days ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
AFPAC
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
COLT
1999
Springer
14 years 1 hour ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...