2254 search results - page 222 / 451 » Computing the minimal covering set |
237
click to vote
TIP
2008
15 years 6 months ago
2008
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
153
click to vote
NN
1998
Springer
15 years 6 months ago
1998
Springer
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
223
click to vote
ICST
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability across their features. This leads to combinatorial explosion of the n...
164
click to vote
SCP
2010
15 years 5 months ago
2010
Dynamic deployment of aspects brings greater flexibility and reuse potential, but requires a proper means for scoping aspects. Scoping issues are particularly crucial in a distri...
191
click to vote
AOR
2010
15 years 4 months ago
2010
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...