Sciweavers

272 search results - page 37 / 55
» Minimal Function Graphs are not Instrumented
Sort
View
64
Voted
CVPR
2010
IEEE
15 years 5 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
FIMH
2009
Springer
15 years 4 months ago
Cardiac Fibre Trace Clustering for the Interpretation of the Human Heart Architecture
Cardiac fibre architecture plays a key role in heart function. Recently, the estimation of fibre structure has been simplified with diffusion tensor MRI (DT-MRI). In order to as...
Carole Frindel, Marc C. Robini, Joël Schaerer...
75
Voted
EOR
2010
99views more  EOR 2010»
14 years 9 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
IPCO
2010
148views Optimization» more  IPCO 2010»
14 years 11 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
13 years 2 days ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...