Sciweavers

1927 search results - page 335 / 386
» UMDAs for dynamic optimization problems
Sort
View
ICML
2010
IEEE
15 years 4 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
135
Voted
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 3 months ago
Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing
The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately...
Quanquan Liang, Mingyan Liu
CN
2006
74views more  CN 2006»
15 years 3 months ago
OMNI: An efficient overlay multicast infrastructure for real-time applications
We consider an overlay architecture (called OMNI) where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming appli...
Suman Banerjee, Christopher Kommareddy, Koushik Ka...
FS
2006
135views more  FS 2006»
15 years 3 months ago
Asymmetric Information in Fads Models
Fads models were introduced by Shiller (1984) and Summers (1986) as plausible alternatives to the efficient markets/constant expected returns assumptions. Under these models, loga...
Paolo Guasoni
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 3 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo