40 search results - page 4 / 8 » Convergence Time Analysis for the Multi-objective Counting O... |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
SMI
2005
IEEE
15 years 3 months ago
2005
IEEE
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
CSR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. How could one estimate the total number of clicks a new advertisement could potentially receive in the current market? This question, called the click volume estimation p...
106
click to vote
SIAMIS
2010
14 years 4 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
74
Voted
ISMDA
2000
Springer
15 years 1 months ago
2000
Springer
In this work, we describe a project, jointly started by DEIS University of Bologna and Dianoema S.p.A., in order to build a system which is able to monitor nosocomial infections. T...