Sciweavers

9997 search results - page 292 / 2000
» The case for crowd computing
Sort
View
CCCG
2003
15 years 8 months ago
Computing Delaunay Triangulation with Imprecise Input Data
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
Ali Asghar Khanban, Abbas Edalat
CPHYSICS
2008
90views more  CPHYSICS 2008»
15 years 6 months ago
Automatic computation of the travelling wave solutions to nonlinear PDEs
Various extensions of the tanh-function method and their implementations for finding explicit travelling wave solutions to nonlinear partial differential equations (PDEs) have bee...
Songxin Liang, David J. Jeffrey
IJBRA
2006
61views more  IJBRA 2006»
15 years 6 months ago
Finding functional promoter motifs by computational methods: a word of caution
: The standard practice in the analysis of promoters is to select promoter regions of convenient length. This may lead to false results when searching for Transcription Factor Bind...
Rajesh Chowdhary, Limsoon Wong, Vladimir B. Bajic
IJBC
2007
77views more  IJBC 2007»
15 years 6 months ago
Stability Computations for Nilpotent Hopf bifurcations in Coupled Cell Systems
Vanderbauwhede and van Gils, Krupa, and Langford studied unfoldings of bifurcations with purely imaginary eigenvalues and a nonsemisimple linearization, which generically occurs i...
M. Golubitsky, M. Krupa
JAL
2007
95views more  JAL 2007»
15 years 6 months ago
Computing shortest paths with uncertainty
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
Tomás Feder, Rajeev Motwani, Liadan O'Calla...