Sciweavers

85 search results - page 17 / 17
» Streaming Algorithms for Some Problems in Log-Space
Sort
View
WWW
2006
ACM
14 years 5 months ago
Efficient query subscription processing for prospective search engines
Current web search engines are retrospective in that they limit users to searches against already existing pages. Prospective search engines, on the other hand, allow users to upl...
Utku Irmak, Svilen Mihaylov, Torsten Suel, Samrat ...
DOLAP
2005
ACM
13 years 6 months ago
Parallel querying of ROLAP cubes in the presence of hierarchies
Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimension...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
SIGMOD
2009
ACM
476views Database» more  SIGMOD 2009»
13 years 11 months ago
MobileMiner: a real world case study of data mining in mobile communication
Mobile communication data analysis has been often used as a background application to motivate many data mining problems. However, very few data mining researchers have a chance t...
Tengjiao Wang, Bishan Yang, Jun Gao, Dongqing Yang...
SSD
2007
Springer
243views Database» more  SSD 2007»
13 years 10 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
PVLDB
2008
107views more  PVLDB 2008»
13 years 4 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald