Sciweavers

5169 search results - page 4 / 1034
» Locality approximation using time
Sort
View
MOC
1998
89views more  MOC 1998»
13 years 6 months ago
Approximation of continuous time stochastic processes by a local linearization method
This paper investigates the rate of convergence of an alternative approximation method for stochastic differential equations. The rates of convergence of the one-step and multi-st...
Isao Shoji
ICALP
2001
Springer
13 years 11 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 8 months ago
On Multidimensional k-Anonymity with Local Recoding Generalization
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
Yang Du, Tian Xia, Yufei Tao, Donghui Zhang, Feng ...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 11 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ISSAC
2005
Springer
70views Mathematics» more  ISSAC 2005»
14 years 3 days ago
Approximation of dynamical systems using s-systems theory: application to biological systems
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...
Laurent Tournier