Sciweavers

583 search results - page 38 / 117
» On small blocking sets and their linearity
Sort
View
FSKD
2005
Springer
98views Fuzzy Logic» more  FSKD 2005»
15 years 4 months ago
Extraction of Representative Keywords Considering Co-occurrence in Positive Documents
In linear text classification, user feedback is usually used to tune up the representative keywords (RK) for a certain class. Despite some algorithms (e.g. Rocchio) deal well with...
Byeong Man Kim, Qing Li, KwangHo Lee, Bo-Yeong Kan...
RTSS
2005
IEEE
15 years 4 months ago
Quantifying the Gap between Embedded Control Models and Time-Triggered Implementations
Mapping a set of feedback control components to executable code introduces errors due to a variety of factors such as discretization, computational delays, and scheduling policies...
Hakan Yazarel, Antoine Girard, George J. Pappas, R...
COLT
2001
Springer
15 years 3 months ago
Geometric Bounds for Generalization in Boosting
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
Shie Mannor, Ron Meir
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
15 years 5 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
77
Voted
COCOS
2003
Springer
139views Optimization» more  COCOS 2003»
15 years 4 months ago
Inter-block Backtracking: Exploiting the Structure in Continuous CSPs
This paper details a technique, called inter-block backtracking (IBB), which improves interval solving of decomposed systems with non-linear equations over the reals. This techniqu...
Bertrand Neveu, Christophe Jermann, Gilles Trombet...