Sciweavers

1568 search results - page 277 / 314
» The problem of examination questions in algorithmics
Sort
View
FLAIRS
2008
15 years 6 months ago
Building Useful Models from Imbalanced Data with Sampling and Boosting
Building useful classification models can be a challenging endeavor, especially when training data is imbalanced. Class imbalance presents a problem when traditional classificatio...
Chris Seiffert, Taghi M. Khoshgoftaar, Jason Van H...
RECOMB
2004
Springer
16 years 4 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
118
Voted
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 10 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
ALT
2007
Springer
15 years 10 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
SOFSEM
2007
Springer
15 years 10 months ago
Deterministic Simulation of a NFA with k -Symbol Lookahead
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
Bala Ravikumar, Nicolae Santean