1984 search results - page 192 / 397 » The colourful feasibility problem |
190
click to vote
GCB
2005
Springer
16 years 1 days ago
2005
Springer
: With increasing number of pathways available in public databases, the process of inferring gene regulatory networks becomes more and more feasible. The major problem of most of t...
162
click to vote
ICANN
2005
Springer
16 years 1 days ago
2005
Springer
This work proposes a theoretical guideline in the specific area of Frequent Itemset Mining (FIM). It supports the hypothesis that the use of neural network technology for the prob...
172
click to vote
IFL
2005
Springer
16 years 19 hour ago
2005
Springer
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
166
click to vote
LPAR
2005
Springer
16 years 11 hour ago
2005
Springer
Integrity checking is an essential means for the preservation of the intended semantics of a deductive database. Incrementality is the only feasible approach to checking and can be...
184
click to vote
PVM
2005
Springer
16 years 3 hour ago
2005
Springer
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...