Sciweavers

2498 search results - page 351 / 500
» Algorithms for the Topological Watershed
Sort
View
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
13 years 3 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
JMLR
2010
169views more  JMLR 2010»
13 years 3 months ago
Consensus-Based Distributed Support Vector Machines
This paper develops algorithms to train support vector machines when training data are distributed across different nodes, and their communication to a centralized processing unit...
Pedro A. Forero, Alfonso Cano, Georgios B. Giannak...
BILDMED
2011
313views Algorithms» more  BILDMED 2011»
12 years 11 months ago
Automatic Multi-modal ToF/CT Organ Surface Registration
Abstract. In the field of image-guided liver surgery (IGLS), the initial registration of the intra-operative organ surface with preoperative tomographic image data is performed on...
Kerstin Müller, Sebastian Bauer, Jakob Wasza,...
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 8 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
MOBIHOC
2005
ACM
14 years 7 months ago
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
Theodoros Salonidis, Leandros Tassiulas