Sciweavers

350 search results - page 13 / 70
» Soft Linear Set Theory
Sort
View
133
Voted
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
145
Voted
ESOP
2008
Springer
15 years 5 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
156
Voted
HYBRID
2010
Springer
15 years 5 months ago
Identifiability of discrete-time linear switched systems
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
Mihály Petreczky, Laurent Bako, Jan H. van ...
145
Voted
ESANN
2004
15 years 5 months ago
Neural dynamics for task-oriented grouping of communicating agents
Abstract. Many real world problems are given in the form of multiple measurements comprising local descriptions or tasks. We propose that a dynamical organization of a population o...
Jochen J. Steil
127
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl