Sciweavers

393 search results - page 75 / 79
» Convex Programming Methods for Global Optimization
Sort
View
IFE
2007
77views more  IFE 2007»
13 years 7 months ago
Drawing Subway Maps: A Survey
Abstract This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such...
Alexander Wolff
NIPS
2007
13 years 9 months ago
A New View of Automatic Relevance Determination
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
David P. Wipf, Srikantan S. Nagarajan
IOR
2002
112views more  IOR 2002»
13 years 7 months ago
Interdisciplinary Meandering in Science
abstract mathematics. My mentor was Professor S. Bochner, a distinguished contributor to harmonic analysis. My classmates included Richard Bellman (who later nurtured the method of...
Samuel Karlin
ATAL
2007
Springer
14 years 1 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 8 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...