Sciweavers

746 search results - page 78 / 150
» Fast (Structured) Newton Computations
Sort
View
PPSN
2010
Springer
13 years 7 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
CONEXT
2008
ACM
13 years 11 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford
ICIP
2007
IEEE
14 years 10 months ago
Edge Preserving Filters using Geodesic Distances on Weighted Orthogonal Domains
We introduce a framework for image enhancement, which smooths images while preserving edge information. Domain (spatial) and range (feature) information are combined in one single...
Luca Bertelli, B. S. Manjunath
MICCAI
2008
Springer
14 years 10 months ago
New Algorithms to Map Asymmetries of 3D Surfaces
Abstract. In this paper, we propose a set of new generic automated processing tools to characterise the local asymmetries of anatomical structures (represented by surfaces) at an i...
Benoît Combès, Sylvain Prima
ICIP
2010
IEEE
13 years 7 months ago
Constructing a sparse convolution matrix for shift varying image restoration problems
Convolution operator is a linear operator characterized by a point spread functions (PSF). In classical image restoration problems, the blur is usually shift invariant and so the ...
Stanley H. Chan