Sciweavers

1716 search results - page 201 / 344
» Proving Conditional Termination
Sort
View
94
Voted
ESM
2000
15 years 2 months ago
Filtered Gibbs sampler for estimating blocking probabilities in WDM optical networks
Blocking probabilities in Wavelength Division Multiplex optical networks are hard to compute for realistic sized systems, even though analytical formulas for the distribution exis...
Felisa J. Vázquez-Abad, Lachlan L. H. Andre...
108
Voted
ATAL
2010
Springer
15 years 1 months ago
Complexity of judgment aggregation: safety of the agenda
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the ...
Ulle Endriss, Umberto Grandi, Daniele Porello
110
Voted
AMC
2007
125views more  AMC 2007»
15 years 28 days ago
Geometric multigrid for high-order regularizations of early vision problems
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Becaus...
Stephen L. Keeling, Gundolf Haase
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 27 days ago
When is there a representer theorem? Vector versus matrix regularizers
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecr...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
89
Voted
DAM
2010
95views more  DAM 2010»
15 years 27 days ago
Excessive factorizations of bipartite multigraphs
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
David Cariolaro, Romeo Rizzi