Sciweavers

1286 search results - page 201 / 258
» Scalable Package Queries in Relational Database Systems
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
15 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...
HICSS
1994
IEEE
157views Biometrics» more  HICSS 1994»
15 years 1 months ago
A Protein Family Classification Method for Analysis of Large DNA Sequences
A method is described for identification and classification of proteins encoded in large DNA sequences. Previously, an automated system was introduced for the general detection of...
Steven Henikoff, Jorja G. Henikoff
LREC
2010
258views Education» more  LREC 2010»
14 years 11 months ago
PolNet - Polish WordNet: Data and Tools
This paper presents the PolNet-Polish WordNet project which aims at building a linguistically oriented ontology for Polish compatible with other WordNet projects such as Princeton...
Zygmunt Vetulani, Marek Kubis, Tomasz Obrêbs...
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 3 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
CIKM
2010
Springer
14 years 8 months ago
On the selectivity of multidimensional routing indices
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...