Sciweavers

5100 search results - page 884 / 1020
» The Linear Complexity of a Graph
Sort
View
COMPGEOM
2005
ACM
15 years 7 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
CMSB
2008
Springer
15 years 6 months ago
Formal Analysis of Abnormal Excitation in Cardiac Tissue
We present the Piecewise Linear Approximation Model of Ion Channel contribution (PLAMIC) to cardiac excitation. We use the PLAMIC model to conduct formal analysis of cardiac arrhyt...
Pei Ye, Radu Grosu, Scott A. Smolka, Emilia Entche...
CONCUR
2008
Springer
15 years 6 months ago
A Scalable and Oblivious Atomicity Assertion
Abstract. This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register imp...
Rachid Guerraoui, Marko Vukolic
DNA
2008
Springer
149views Bioinformatics» more  DNA 2008»
15 years 6 months ago
Connecting the Dots: Molecular Machinery for Distributed Robotics
Abstract. Nature is considered one promising area to search for inspiration in designing robotic systems. Some work in swarm robotics has tried to build systems that resemble distr...
Yuriy Brun, Dustin Reishus
AAAI
2010
15 years 6 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi