Sciweavers

4894 search results - page 727 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
BMCBI
2010
117views more  BMCBI 2010»
13 years 8 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 8 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
JMLR
2006
124views more  JMLR 2006»
13 years 8 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
PAMI
2008
134views more  PAMI 2008»
13 years 8 months ago
Bittracker - A Bitmap Tracker for Visual Tracking under Very General Conditions
This paper addresses the problem of visual tracking under very general conditions: a possibly nonrigid target whose appearance may drastically change over time, general camera moti...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
INFOCOM
2010
IEEE
13 years 6 months ago
Information Quality Aware Routing in Event-Driven Sensor Networks
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
Hwee-Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng ...