Sciweavers

638 search results - page 83 / 128
» Efficient algorithms for evaluating xpath over streams
Sort
View
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
14 years 10 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
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 9 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 9 months ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen
PET
2010
Springer
13 years 10 months ago
Achieving Efficient Query Privacy for Location Based Services
Mobile smartphone users frequently need to search for nearby points of interest from a location based service, but in a way that preserves the privacy of the users' locations...
Femi G. Olumofin, Piotr K. Tysowski, Ian Goldberg,...
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
14 years 1 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...