Sciweavers

606 search results - page 62 / 122
» Discrete Time Process Algebra
Sort
View
COMPGEOM
2010
ACM
14 years 22 days ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
PADS
2006
ACM
14 years 1 months ago
Aurora: An Approach to High Throughput Parallel Simulation
A master/worker paradigm for executing large-scale parallel discrete event simulation programs over networkenabled computational resources is proposed and evaluated. In contrast t...
Alfred Park, Richard M. Fujimoto
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 7 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
MOC
1998
175views more  MOC 1998»
13 years 7 months ago
Convergence of a non-stiff boundary integral method for interfacial flows with surface tension
Boundary integral methods to simulate interfacial flows are very sensitive to numerical instabilities. In addition, surface tension introduces nonlinear terms with high order spat...
Héctor D. Ceniceros, Thomas Y. Hou
UAI
2004
13 years 9 months ago
Dynamical Systems Trees
We propose dynamical systems trees (DSTs) as a flexible model for describing multiple processes that interact via a hierarchy of aggregating processes. DSTs extend nonlinear dynam...
Andrew Howard, Tony Jebara