Sciweavers

609 search results - page 40 / 122
» Linear-Time Computation of Similarity Measures for Sequentia...
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 2 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
VRST
2009
ACM
15 years 4 months ago
Indexing and retrieval of human motion data by a hierarchical tree
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
Shuangyuan Wu, Zhaoqi Wang, Shihong Xia
IPL
2007
96views more  IPL 2007»
14 years 9 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...
CIKM
2005
Springer
15 years 3 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
CLIN
2004
14 years 11 months ago
Syntactic Contexts for Finding Semantically Related Words
Finding semantically related words is a first step in the direction of automatic ontology building. Guided by the view that similar words occur in similar contexts, we looked at t...
Lonneke van der Plas, Gosse Bouma