Sciweavers

1756 search results - page 110 / 352
» Mining Query Logs
Sort
View
ICS
2010
Tsinghua U.
15 years 5 months ago
A query language for understanding component interactions in production systems
When something unexpected happens in a large production system, administrators must first perform a search to isolate which components and component interactions are likely to be...
Adam J. Oliner, Alex Aiken
91
Voted
STACS
2005
Springer
15 years 6 months ago
Approximate Range Mode and Range Median Queries
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yih...
83
Voted
APPROX
2005
Springer
94views Algorithms» more  APPROX 2005»
15 years 6 months ago
Testing Periodicity
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
Oded Lachish, Ilan Newman
88
Voted
KDD
1994
ACM
82views Data Mining» more  KDD 1994»
15 years 4 months ago
Architectural Support for Data Mining
Oneof the mainobstacles in applying data mining techniques to large, real-world databasesis the lack of efficient data management.In this paper, wepresent the design and implement...
Marcel Holsheimer, Martin L. Kersten
101
Voted
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 4 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei