Sciweavers

540 search results - page 94 / 108
» The Sinkhorn-Knopp Algorithm: Convergence and Applications
Sort
View
EMMCVPR
1997
Springer
13 years 12 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
ALT
2003
Springer
13 years 11 months ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann
GRAPHICSINTERFACE
2001
13 years 9 months ago
Novel Solver for Dynamic Surfaces
Physics-based modeling integrates dynamics and geometry. The standard methods to solve the Lagrangian equations use a direct approach in the spatial domain. Though extremely power...
Sumantro Ray, Hong Qin
COMSWARE
2007
IEEE
13 years 11 months ago
Efficient Design of End-to-End Probes for Source-Routed Networks
Migration to a converged network has caused service providers to deploy real time applications such as voice over an IP (VoIP) network. From the provider's perspective, the s...
Srinivasan Parthasarathya, Rajeev Rastogi, Marina ...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
13 years 11 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali