Sciweavers

90 search results - page 17 / 18
» Connecting face hitting sets in planar graphs
Sort
View
COMPGEOM
2001
ACM
13 years 8 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
INFOCOM
2011
IEEE
12 years 8 months ago
Spherical representation and polyhedron routing for load balancing in wireless sensor networks
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...
Xiaokang Yu, Xiaomeng Ban, Wei Zeng, Rik Sarkar, X...
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 5 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
ISBI
2009
IEEE
13 years 11 months ago
Cell Tracking and Segmentation in Electron Microscopy Images Using Graph Cuts
Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. Ho...
Huei-Fang Yang, Yoonsuck Choe
TCOM
2010
109views more  TCOM 2010»
13 years 3 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik