Sciweavers

3096 search results - page 9 / 620
» The Generalized FITC Approximation
Sort
View
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 4 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
BMVC
2010
13 years 6 months ago
Generalized RBF feature maps for Efficient Detection
Kernel methods yield state-of-the-art performance in certain applications such as image classification and object detection. However, large scale problems require machine learning...
Sreekanth Vempati, Andrea Vedaldi, Andrew Zisserma...
JMLR
2012
11 years 11 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
JAIR
1998
198views more  JAIR 1998»
13 years 8 months ago
Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
Alberto Ruiz, Pedro E. López-de-Teruel, M. ...
TC
2002
13 years 8 months ago
General Modeling and Performance Analysis for Location Management in Wireless Mobile Networks
Location management plays a significant role in current and future wireless mobile networks in effectively delivering services to the mobile users on the move. Many schemes have be...
Yuguang Fang