7751 search results - page 256 / 1551 » Data streams: algorithms and applications |
252
click to vote
SPE
2008
15 years 7 months ago
2008
The innate verbosity of the Extensible Markup Language remains one of its main weaknesses, especially when large XML documents are concerned. This problem can be solved with the a...
206
click to vote
WADS
1997
Springer
15 years 11 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
188
click to vote
PODS
2003
ACM
16 years 7 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
175
click to vote
VLDB
2004
ACM
16 years 18 days ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
212
click to vote
DSOM
2006
Springer
15 years 11 months ago
2006
Springer
Load sharing in the data centre is an essential strategy for meeting service levels in high volume and high availability services. We investigate the accuracy with which simple, cl...