Sciweavers

417 search results - page 5 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
DAM
2008
136views more  DAM 2008»
13 years 7 months ago
General theory of information transfer: Updated
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
Rudolf Ahlswede
ICML
2010
IEEE
13 years 8 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
FOCS
2004
IEEE
13 years 11 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
CG
2005
Springer
13 years 7 months ago
A new algorithm for Boolean operations on general polygons
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
Yu Peng, Jun-Hai Yong, Wei-Ming Dong, Hui Zhang, J...
CIKM
2009
Springer
14 years 2 months ago
Using opinion-based features to boost sentence retrieval
Opinion mining has become recently a major research topic. A wide range of techniques have been proposed to enable opinion-oriented information seeking systems. However, little is...
Ronald T. Fernández, David E. Losada