Sciweavers

559 search results - page 64 / 112
» Indexing Weighted-Sequences in Large Databases
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
14 years 3 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 9 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
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 9 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
IR
2006
13 years 9 months ago
Multilingual modeling of cross-lingual spelling variants
Technical term translations are important for cross-lingual information retrieval. In many languages, new technical terms have a common origin rendered with different spelling of ...
Krister Lindén