Sciweavers

234 search results - page 6 / 47
» Time skewing made simple
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 8 months ago
Analyzing Range Queries on Spatial Data
Analysis of range queries on spatial (multidimensional) data is both important and challenging. Most previous analysis attempts have made certain simplifying assumptions about the...
Ji Jin, Ning An, Anand Sivasubramaniam
PADS
2006
ACM
14 years 1 months ago
Analysing the Performance of Optimistic Synchronisation Algorithms in Simulations of Multi-Agent Systems
In this paper we present a detailed analysis of the performance of the Decision Theoretic Read Delay (DTRD) optimistic synchronisation algorithm for simulations of Multistems. We ...
Michael Lees, Brian Logan, Dan Chen, Ton Oguara, G...
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
13 years 8 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico
JCP
2008
114views more  JCP 2008»
13 years 7 months ago
Statistical Analysis and Data Analysis of Stock Market by Interacting Particle Models
The statistical analysis of Chinese stock market fluctuations modeled by the interacting particle systems has been done in this paper. The contact model and voter model of the inte...
Jun Wang, Bingli Fan, Tiansong Wang
SPIRE
2005
Springer
14 years 29 days ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel