Sciweavers

4934 search results - page 358 / 987
» complexity 2008
Sort
View
DAM
2006
78views more  DAM 2006»
15 years 6 months ago
Hybrid rounding techniques for knapsack problems
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Monaldo Mastrolilli, Marcus Hutter
DEDS
2006
119views more  DEDS 2006»
15 years 6 months ago
Diagnosability of Discrete Event Systems with Modular Structure
The diagnosis of unobservable faults in large and complex discrete event systems modeled by parallel composition of automata is considered. A modular approach is developed for diag...
Olivier Contant, Stéphane Lafortune, Demost...
IJAC
2008
97views more  IJAC 2008»
15 years 6 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Frédérique Bassino, Cyril Nicaud, Pa...
IJBC
2008
85views more  IJBC 2008»
15 years 6 months ago
Center bifurcation for Two-Dimensional Border-Collision Normal Form
In this work we study some properties associated with the bordercollision bifurcations in a two-dimensional piecewise linear map in canonical form, related to the case in which a ...
Iryna Sushko, Laura Gardini
IJCV
2008
241views more  IJCV 2008»
15 years 6 months ago
Object Class Recognition and Localization Using Sparse Features with Limited Receptive Fields
We investigate the role of sparsity and localized features in a biologically-inspired model of visual object classification. As in the model of Serre, Wolf, and Poggio, we first a...
Jim Mutch, David G. Lowe