Sciweavers

1756 search results - page 250 / 352
» Mining Query Logs
Sort
View
PAM
2012
Springer
12 years 5 months ago
A Sequence-Oriented Stream Warehouse Paradigm for Network Monitoring Applications
Network administrators are faced with the increasingly challenging task of monitoring their network’s health in real time, drawing upon diverse and voluminous measurement data fe...
Lukasz Golab, Theodore Johnson, Subhabrata Sen, Je...
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 10 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 4 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
GIR
2006
ACM
14 years 4 months ago
Detecting Geographical Serving Area of Web Resources
Most human activities occur around where the user is physically located. Knowing the geographical serving area of web resources, therefore, is very important for many web applicat...
Qi Zhang, Xing Xie, Lee Wang, Lihua Yue, Wei-Ying ...
COMPGEOM
2007
ACM
14 years 2 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann