Sciweavers

1567 search results - page 241 / 314
» Compressing Relations and Indexes
Sort
View
WWW
2008
ACM
14 years 11 months ago
Personalized web exploration with task models
Personalized Web search has emerged as one of the hottest topics for both the Web industry and academic researchers. However, the majority of studies on personalized search focuse...
Jae-wook Ahn, Peter Brusilovsky, Daqing He, Jonath...
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 10 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 10 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
ERCIMDL
2009
Springer
139views Education» more  ERCIMDL 2009»
14 years 4 months ago
Geographic Information Retrieval and Digital Libraries
In this demonstration we will examine the effectiveness of Geographic Information Retrieval (GIR) methods in digital library interfaces. We will show how various types of informat...
Ray R. Larson
PETRA
2009
ACM
14 years 4 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...