Sciweavers

113 search results - page 4 / 23
» Obnoxious Centers in Graphs
Sort
View
INFOCOM
2008
IEEE
15 years 3 months ago
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
Animashree Anandkumar, Lang Tong, Ananthram Swami,...
98
Voted
SMI
2006
IEEE
152views Image Analysis» more  SMI 2006»
15 years 3 months ago
A Laplacian Based Approach for Free-Form Deformation of Sparse Low-degree IMplicit Surfaces
Sparse Low-degree IMplicit (SLIM) surface [11] is a recently developed non-conforming surface representation. In this paper, a method for free-form deformation of SLIM surfaces is...
Yutaka Ohtake, Takashi Kanai, Kiwamu Kase
IWCIA
2004
Springer
15 years 2 months ago
Integral Trees: Subtree Depth and Diameter
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo
IPMI
2009
Springer
15 years 2 months ago
Dense Registration with Deformation Priors
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
Ben Glocker, Nikos Komodakis, Nassir Navab, Georgi...
EUROPAR
2004
Springer
15 years 2 months ago
Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
Kayhan Erciyes