2252 search results - page 175 / 451 » Lower Bounds for Dynamic Algorithms |
240
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
127
click to vote
SENSYS
2004
ACM
15 years 9 months ago
2004
ACM
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over...
120
click to vote
AUTOMATICA
2008
15 years 3 months ago
2008
This paper presents a guaranteed method for the parameter estimation of nonlinear models in a bounded-error context. This method is based on functions which consists of the differ...
129
click to vote
JC
2007
15 years 3 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
128
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...