403 search results - page 59 / 81 » Sampling Bounds for Stochastic Optimization |
RECOMB
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
ICIAR
2004
Springer
14 years 3 months ago
2004
Springer
We present an information theoretic approach for learning a linear dimension reduction transform for object classification. The theoretic guidance of the approach is that the trans...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
COR
2006
13 years 10 months ago
2006
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
CDC
2010
IEEE
13 years 1 months ago
2010
IEEE
— We propose and analyze the Persistent Patrol Problem (PPP). An unmanned aerial vehicle (UAV) moving with constant speed and unbounded acceleration patrols a bounded region of t...