Sciweavers

15073 search results - page 354 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
138
Voted
ICPR
2004
IEEE
16 years 6 months ago
On Performance Evaluation of Face Detection and Localization Algorithms
When comparing different methods for face detection or localization, one realizes that just simply comparing the reported results is misleading as, even if the results are reporte...
Jean-Philippe Thiran, Sébastien Marcel, Vla...
ICPR
2002
IEEE
16 years 6 months ago
An Evaluation of the WPE Algorithm Using Tangent Distance
Weighting Prototype Editing (WPE) is a novel approach to edit a given set of prototypes so that the resulting set can outperform the original one in terms of the Nearest Neighbor ...
Roberto Paredes Palacios, Enrique Vidal, Daniel Ke...
134
Voted
DISOPT
2008
99views more  DISOPT 2008»
15 years 5 months ago
Computing robust basestock levels
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
Daniel Bienstock, Nuri Özbay
TCS
2008
15 years 4 months ago
Computations with quasiseparable polynomials and matrices
In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices gener...
Tom Bella, Yuli Eidelman, Israel Gohberg, Vadim Ol...
156
Voted
ECAI
2010
Springer
15 years 2 months ago
On Computing Backbones of Propositional Theories
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
João Marques-Silva, Mikolás Janota, ...