Sciweavers

2392 search results - page 25 / 479
» Matching data dissemination algorithms to application requir...
Sort
View
AINA
2009
IEEE
14 years 9 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay
IS
2011
14 years 3 months ago
Collection trees for event-monitoring queries
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Antonios Deligiannakis, Yannis Kotidis, Vassilis S...
EDBT
2004
ACM
234views Database» more  EDBT 2004»
15 years 11 months ago
A Condensation Approach to Privacy Preserving Data Mining
In recent years, privacy preserving data mining has become an important problem because of the large amount of personal data which is tracked by many business applications. In many...
Charu C. Aggarwal, Philip S. Yu
ANCS
2006
ACM
15 years 5 months ago
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
Sailesh Kumar, Jonathan S. Turner, John Williams
111
Voted
3DIM
1999
IEEE
15 years 4 months ago
Large Data Sets and Confusing Scenes in 3-D Surface Matching and Recognition
In this paper, we report on recent extensions to a surface matching algorithm based on local 3-D signatures. This algorithm was previously shown to be effective in view registrati...
Owen T. Carmichael, Daniel F. Huber, Martial Heber...