Sciweavers

1289 search results - page 78 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
ICCV
2003
IEEE
15 years 11 months ago
Feature Selection for Unsupervised and Supervised Inference: the Emergence of Sparsity in a Weighted-based Approach
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
Lior Wolf, Amnon Shashua
PE
2006
Springer
107views Optimization» more  PE 2006»
14 years 9 months ago
Efficient steady-state analysis of second-order fluid stochastic Petri nets
This paper presents an efficient solution technique for the steady-state analysis of the second-order Stochastic Fluid Model underlying a second-order Fluid Stochastic Petri Net (...
Marco Gribaudo, Rossano Gaeta
FGCS
2008
102views more  FGCS 2008»
14 years 10 months ago
Making the best of a bad situation: Prioritized storage management in GEMS
As distributed storage systems grow, the response time between detection and repair of the error becomes significant. Systems built on shared servers have additional complexity be...
Justin M. Wozniak, Paul Brenner, Douglas Thain, Aa...
CEC
2010
IEEE
14 years 11 months ago
Constrained global optimization of low-thrust interplanetary trajectories
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
Chit Hong Yam, David Di Lorenzo, Dario Izzo
WOTE
2010
14 years 8 months ago
On Optical Mark-Sense Scanning
Optical mark-sense scanning has lead to a resurgence in the use of paper ballots in the United States, despite a century of strong competition from paperless direct-recording votin...
Douglas W. Jones