Sciweavers

1786 search results - page 199 / 358
» The Structure of Factor Oracles
Sort
View
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
16 years 7 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 7 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
SIGMOD
2007
ACM
188views Database» more  SIGMOD 2007»
16 years 6 months ago
Intel Mash Maker: join the web
Intel? Mash Maker is an interactive tool that tracks what the user is doing and tries to infer what information and visualizations they might find useful for their current task. M...
Robert Ennals, Eric A. Brewer, Minos N. Garofalaki...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 12 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
COMPGEOM
2010
ACM
15 years 11 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...