3049 search results - page 365 / 610 » On the Convergence of Bound Optimization Algorithms |
205
Voted
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
178
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
152
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
155
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
149
click to vote
ISCAS
2006
IEEE
2006
IEEE
A novel approach to L2-sensitivity minimization of digital filters subject to L2-scaling constraints
16 years 19 days ago
Abstract— This paper proposes a novel approach to L2sensitivity minimization problem of state-space digital filters subject to L2-scaling constraints. The proposed approach redu...