Sciweavers

2899 search results - page 400 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ICML
2010
IEEE
15 years 6 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
TCS
2008
15 years 5 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
TOG
2008
143views more  TOG 2008»
15 years 5 months ago
Discovering structural regularity in 3D geometry
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
Mark Pauly, Niloy J. Mitra, Johannes Wallner, Helm...
115
Voted
JVCA
2007
93views more  JVCA 2007»
15 years 5 months ago
Gradient-based shell generation and deformation
Shell becomes popular in a variety of modeling techniques for representing small-scale features and increasing visual complexity. Current shell generation algorithms do not measur...
Jin Huang, Xinguo Liu, Haiyang Jiang, Qing Wang, H...
VTC
2010
IEEE
145views Communications» more  VTC 2010»
15 years 4 months ago
Ant-Colony Based Near-ML Space-Time Multiuser Detection for the STBC Assisted DS-CDMA Uplink
— In this contribution, a novel Ant Colony Optimization (ACO) based Space-Time (ST) Multiuser Detection (MUD) algorithm was proposed in order to improve the Bit Error Ratio (BER)...
Chong Xu, Lie-Liang Yang, Lajos Hanzo