Sciweavers

1480 search results - page 128 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
99
Voted
CVPR
2004
IEEE
15 years 4 months ago
Diffeomorphic Matching of Distributions: A New Approach for Unlabelled Point-Sets and Sub-Manifolds Matching
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
Joan Glaunes, Alain Trouvé, Laurent Younes
101
Voted
ICML
2010
IEEE
15 years 1 months ago
Online Learning for Group Lasso
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
Haiqin Yang, Zenglin Xu, Irwin King, Michael R. Ly...
89
Voted
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 27 days ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
CPM
2004
Springer
84views Combinatorics» more  CPM 2004»
15 years 6 months ago
Small Phylogeny Problem: Character Evolution Trees
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
143
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz