Sciweavers

70 search results - page 11 / 14
» Consonant Random Sets: Structure and Properties
Sort
View
COMPGEOM
2001
ACM
13 years 11 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
MICCAI
2002
Springer
14 years 8 months ago
Recognizing Deviations from Normalcy for Brain Tumor Segmentation
A framework is proposed for the segmentation of brain tumors from MRI. Instead of training on pathology, the proposed method trains exclusively on healthy tissue. The algorithm att...
David T. Gering, W. Eric L. Grimson, Ron Kikinis
BMCBI
2007
102views more  BMCBI 2007»
13 years 7 months ago
qPIPSA: Relating enzymatic kinetic parameters and interaction fields
Background: The simulation of metabolic networks in quantitative systems biology requires the assignment of enzymatic kinetic parameters. Experimentally determined values are ofte...
Razif R. Gabdoulline, Matthias Stein, Rebecca C. W...
FSTTCS
2004
Springer
14 years 29 days ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
RSA
2010
107views more  RSA 2010»
13 years 6 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou