Sciweavers

1887 search results - page 346 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
IJDLS
2010
131views more  IJDLS 2010»
13 years 5 months ago
Annotating Historical Archives of Images
Recent initiatives like the Million Book Project and Google Print Library Project have already archived several million books in digital format, and within a few years a significa...
Xiaoyue Wang, Lexiang Ye, Eamonn J. Keogh, Christi...
BIOINFORMATICS
2011
12 years 11 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
KDD
2004
ACM
285views Data Mining» more  KDD 2004»
14 years 1 months ago
Effective localized regression for damage detection in large complex mechanical structures
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
13 years 12 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass