Sciweavers

1798 search results - page 265 / 360
» A Tree for All Seasons
Sort
View
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 9 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 9 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
ICFP
2006
ACM
14 years 9 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert
SAC
2010
ACM
14 years 4 months ago
Quality of service for multicasting using NICE
To distribute data from one sender to multiple receivers efficiently and concurrently, multicasting is one of the most appropriate mechanisms. Application Layer Multicast (ALM), ...
Marc Brogle, Sebastian Barthlomé, Torsten B...
ACSAC
2009
IEEE
14 years 4 months ago
Privacy through Noise: A Design Space for Private Identification
To protect privacy in large systems, users must be able to authenticate against a central server without disclosing their identity to the network. Private identification protocols ...
Karsten Nohl, David Evans