Sciweavers

48 search results - page 7 / 10
» Profile minimization on products of graphs
Sort
View
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...
CGO
2008
IEEE
14 years 11 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
ICCV
2007
IEEE
15 years 11 months ago
Globally Optimal Image Segmentation with an Elastic Shape Prior
So far global optimization techniques have been developed independently for the tasks of shape matching and image segmentation. In this paper we show that both tasks can in fact b...
Thomas Schoenemann, Daniel Cremers
APPML
2007
92views more  APPML 2007»
14 years 9 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
14 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani