Sciweavers

2168 search results - page 201 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
127
Voted
ICCMS
2009
118views more  ICCMS 2009»
15 years 1 months ago
Optimized Parallel Implementation of Gillespie's First Reaction Method on Graphics Processing Units
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
Cristian Dittamo, Davide Cangelosi
141
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
WWW
2005
ACM
16 years 4 months ago
BackRank: an alternative for PageRank?
This paper proposes to extend a previous work, The Effect of the Back Button in a Random Walk: Application for PageRank [5]. We introduce an enhanced version of the PageRank algor...
Mohamed Bouklit, Fabien Mathieu
153
Voted
WD
2010
15 years 1 months ago
Centrality-based routing for Wireless Sensor Networks
The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theo...
Eduardo M. R. Oliveira, Heitor S. Ramos, Antonio A...
146
Voted
COMPGEOM
2003
ACM
15 years 9 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk