Sciweavers

3096 search results - page 315 / 620
» The Generalized FITC Approximation
Sort
View
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 12 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
NIPS
2007
15 years 8 months ago
An Analysis of Convex Relaxations for MAP Estimation
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
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
BMCBI
2008
139views more  BMCBI 2008»
15 years 6 months ago
The C1C2: A framework for simultaneous model selection and assessment
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg
ICCV
2009
IEEE
16 years 11 months ago
Patch based Within-Object Classification
Advances in object detection have made it possible to collect large databases of certain objects. In this paper we exploit these datasets for within-object classification. For e...
Jania Aghajanian, Jonathan Warrell, Simon J.D. Pri...