Sciweavers

4377 search results - page 375 / 876
» Mass problems and randomness
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 7 months ago
Learning Low-Density Separators
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
Shai Ben-David, Tyler Lu, Dávid Pál,...
189
Voted
CCR
2006
117views more  CCR 2006»
15 years 6 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
JMIV
2006
161views more  JMIV 2006»
15 years 6 months ago
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
Jérôme Darbon, Marc Sigelle
EOR
2007
147views more  EOR 2007»
15 years 6 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov
FTCIT
2007
88views more  FTCIT 2007»
15 years 6 months ago
Topics in Multi-User Information Theory
This survey reviews fundamental concepts of multi-user information theory. Starting with typical sequences, the survey builds up knowledge on random coding, binning, superposition...
Gerhard Kramer