Sciweavers

5864 search results - page 200 / 1173
» Can We Work around Numerical Methods
Sort
View
ICSM
2003
IEEE
15 years 10 months ago
Source-Based Software Risk Assessment
The paper reports on a method for software risk assessments that takes into account “primary facts” and “secondary facts”. Primary facts are those obtained through automat...
Arie van Deursen, Tobias Kuipers
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 8 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
151
Voted
TCSV
2008
195views more  TCSV 2008»
15 years 4 months ago
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
Yun Fu, Zhu Li, Junsong Yuan, Ying Wu, Thomas S. H...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 5 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
INFORMS
2010
177views more  INFORMS 2010»
15 years 3 months ago
Binarized Support Vector Machines
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
Emilio Carrizosa, Belen Martin-Barragan, Dolores R...