3545 search results - page 110 / 709 » Computational methods for case-cohort studies |
183
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
139
click to vote
ICRA
2006
IEEE
16 years 13 days ago
2006
IEEE
— Due to the abundant application background, the optimization of maintenance problem has been extensively studied in the past decades. Besides the well-known difficulty of larg...
168
click to vote
AAAI
2004
15 years 7 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
190
click to vote
ICAI
2004
15 years 7 months ago
2004
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
196
click to vote
NIPS
2004
15 years 7 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...