Sciweavers

JMLR
2012
12 years 1 months ago
Stick-Breaking Beta Processes and the Poisson Process
We show that the stick-breaking construction of the beta process due to Paisley et al. (2010) can be obtained from the characterization of the beta process as a Poisson process. S...
John William Paisley, David M. Blei, Michael I. Jo...
SIAMJO
2002
88views more  SIAMJO 2002»
13 years 11 months ago
Subdifferential Conditions for Calmness of Convex Constraints
We study subdifferential conditions of the calmness property for multifunctions representing convex constraint systems in a Banach space. Extending earlier work in finite dimension...
René Henrion, Abderrahim Jourani
NIPS
2003
14 years 24 days ago
Error Bounds for Transductive Learning via Compression and Clustering
This paper is concerned with transductive learning. Although transduction appears to be an easier task than induction, there have not been many provably useful algorithms and boun...
Philip Derbeko, Ran El-Yaniv, Ron Meir
AAAI
2007
14 years 1 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
VISUALIZATION
1997
IEEE
14 years 3 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
ALT
2006
Springer
14 years 8 months ago
Unsupervised Slow Subspace-Learning from Stationary Processes
Abstract. We propose a method of unsupervised learning from stationary, vector-valued processes. A low-dimensional subspace is selected on the basis of a criterion which rewards da...
Andreas Maurer