Sciweavers

156 search results - page 6 / 32
» Near-optimal Observation Selection using Submodular Function...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
A kernelized maximal-figure-of-merit learning approach based on subspace distance minimization
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
Byungki Byun, Chin-Hui Lee
AAAI
2011
12 years 7 months ago
Logistic Methods for Resource Selection Functions and Presence-Only Species Distribution Models
In order to better protect and conserve biodiversity, ecologists use machine learning and statistics to understand how species respond to their environment and to predict how they...
Steven Phillips, Jane Elith
CORR
2011
Springer
209views Education» more  CORR 2011»
12 years 11 months ago
Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems
In this work, we consider a retailer selling a single product with limited on-hand inventory over a finite selling season. Customer demand arrives according to a Poisson process,...
Zizhuo Wang, Shiming Deng, Yinyu Ye
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Robust incentive techniques for peer-to-peer networks
Lack of cooperation (free riding) is one of the key problems that confronts today’s P2P systems. What makes this problem particularly difficult is the unique set of challenges ...
Michal Feldman, Kevin Lai, Ion Stoica, John Chuang
WIOPT
2011
IEEE
12 years 11 months ago
Network utility maximization over partially observable Markovian channels
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
Chih-Ping Li, Michael J. Neely