Sciweavers

811 search results - page 54 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 10 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CSDA
2010
118views more  CSDA 2010»
13 years 10 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
COLT
2010
Springer
13 years 8 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
13 years 12 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
CCR
2002
96views more  CCR 2002»
13 years 10 months ago
Adaptive bandwidth control for efficient aggregate QoS provisioning
Abstract-This paper proposes an adaptive bandwidth control algorithm that efficiently provides aggregate loss guarantee to resolve the problem of inefficient bandwidth allocation d...
Peerapon Siripongwutikorn, Sujata Banerjee, David ...