3735 search results - page 260 / 747 » Order compression schemes |
184
click to vote
NA
2007
15 years 6 months ago
2007
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
235
click to vote
ICS
2005
Tsinghua U.
16 years 2 days ago
2005
Tsinghua U.
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
178
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
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...
188
click to vote
TON
2002
15 years 6 months ago
2002
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
205
click to vote
TKDE
2010
15 years 1 months ago
2010
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...