Sciweavers

21 search results - page 2 / 5
» Data Dependent Concentration Bounds for Sequential Predictio...
Sort
View
JMLR
2011
137views more  JMLR 2011»
13 years 7 days ago
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
Vladimir V. V'yugin
JCP
2007
108views more  JCP 2007»
13 years 5 months ago
A Genetic Algorithm Method to Assimilate Sensor Data for a Toxic Contaminant Release
— Following a toxic contaminant release, either accidental or intentional, predicting the transport and dispersion of the contaminant becomes a critical problem for Homeland Defe...
Sue Ellen Haupt, George S. Young, Christopher T. A...
JPDC
2007
184views more  JPDC 2007»
13 years 5 months ago
Modeling of concurrent web sessions with bounded inconsistency in shared data
Client interactions with modern web-accessible network services are typically organized into sessions involving multiple requests that read and write shared application data. Ther...
Alexander Totok, Vijay Karamcheti
GBRPR
2007
Springer
13 years 11 months ago
Hierarchy Construction Schemes Within the Scale Set Framework
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
Jean-Hugues Pruvot, Luc Brun
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 6 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro