Sciweavers

1110 search results - page 162 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
ICML
2010
IEEE
15 years 11 hour 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
105
Voted
ICASSP
2011
IEEE
14 years 2 months ago
Near-field array shape calibration
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
Shuang Wan, Pei-Jung Chung, Bernard Mulgrew
AAAI
2007
15 years 1 months ago
Automated Online Mechanism Design and Prophet Inequalities
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tu...
87
Voted
CHI
2009
ACM
15 years 5 months ago
Understanding knowledge management practices for early design activity and its implications for reuse
Prior knowledge is a critical resource for design, especially when designers are striving to generate new ideas for complex problems. Systems that improve access to relevant prior...
Moushumi Sharmin, Brian P. Bailey, Cole Coats, Kev...
ACCV
2009
Springer
15 years 5 months ago
An Online Framework for Learning Novel Concepts over Multiple Cues
Abstract. We propose an online learning algorithm to tackle the problem of learning under limited computational resources in a teacher-student scenario, over multiple visual cues. ...
Luo Jie, Francesco Orabona, Barbara Caputo