Sciweavers

2292 search results - page 309 / 459
» Hierarchical approximation and localization
Sort
View
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
15 years 7 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
NIPS
1990
15 years 7 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
BMCBI
2010
158views more  BMCBI 2010»
15 years 6 months ago
Validation of differential gene expression algorithms: Application comparing fold-change estimation to hypothesis testing
Background: Sustained research on the problem of determining which genes are differentially expressed on the basis of microarray data has yielded a plethora of statistical algorit...
Corey M. Yanofsky, David R. Bickel
JCB
2008
90views more  JCB 2008»
15 years 6 months ago
A Simple Model of the Modular Structure of Transcriptional Regulation in Yeast
Resolving the general organizational principles that govern the interactions during transcriptional gene regulation has great relevance for understanding disease progression, biof...
Vladimir Filkov, Nameeta Shah
NECO
2007
127views more  NECO 2007»
15 years 6 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado