Sciweavers

17049 search results - page 399 / 3410
» cans 2007
Sort
View
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
15 years 7 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
IJCAI
2007
15 years 9 months ago
Compiling Bayesian Networks Using Variable Elimination
Compiling Bayesian networks has proven an effective approach for inference that can utilize both global and local network structure. In this paper, we define a new method of comp...
Mark Chavira, Adnan Darwiche
211
Voted
ICMLA
2004
15 years 9 months ago
Two new regularized AdaBoost algorithms
AdaBoost rarely suffers from overfitting problems in low noise data cases. However, recent studies with highly noisy patterns clearly showed that overfitting can occur. A natural s...
Yijun Sun, Jian Li, William W. Hager
CASCON
1996
160views Education» more  CASCON 1996»
15 years 9 months ago
Automatic generation of performance models for distributed application systems
Organizations have become increasingly dependent on computing systems to achieve their business goals. The performance of these systems in terms of response times and cost has a m...
M. Qin, R. Lee, Asham El Rayess, Vidar Vetland, Je...
BMCBI
2004
108views more  BMCBI 2004»
15 years 7 months ago
Enhanced protein domain discovery using taxonomy
Background: It is well known that different species have different protein domain repertoires, and indeed that some protein domains are kingdom specific. This information has not ...
Lachlan James M. Coin, Alex Bateman, Richard Durbi...