Sciweavers

315 search results - page 40 / 63
» Simple Distributed Weighted Matchings
Sort
View
PODC
2005
ACM
14 years 1 months ago
Proof labeling schemes
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
Amos Korman, Shay Kutten, David Peleg
MICCAI
2009
Springer
14 years 5 months ago
DISCO: A Coherent Diffeomorphic Framework for Brain Registration under Exhaustive Sulcal Constraints
Abstract. Neuroimaging at the group level requires spatial normalization of individual structural data. We propose a geometric approach that consists in matching a series of cortic...
Guillaume Auzias, Joan Glaunes, Olivier Colliot, M...
ISBI
2009
IEEE
14 years 2 months ago
A Data-Driven Approach to Discovering Common Brain Anatomy
An atlas defines a common coordinate system to enable the comparison of data from different subjects. Key in the development of a brain atlas are the identification of a common ...
Neil I. Weisenfeld, Simon K. Warfield
VTC
2006
IEEE
152views Communications» more  VTC 2006»
14 years 1 months ago
Cross-Layer Resource Allocation via Geometric Programming in Fading Broadcast Channels
Abstract— In a fading broadcast channel (BC), Queue Proportional Scheduling (QPS) is presented via geometric programming (GP). Given the current queue state, QPS allocates a data...
Kibeom Seong, Ravi Narasimhan, John M. Cioffi
BTW
2005
Springer
80views Database» more  BTW 2005»
14 years 1 months ago
Measuring the Quality of Approximated Clusterings
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
Hans-Peter Kriegel, Martin Pfeifle