Sciweavers

1116 search results - page 192 / 224
» Domination Mining and Querying
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 7 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...
SENSYS
2005
ACM
14 years 1 months ago
TSAR: a two tier sensor storage architecture using interval skip graphs
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
Peter Desnoyers, Deepak Ganesan, Prashant J. Sheno...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 8 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
SIGIR
2010
ACM
13 years 11 months ago
Assessing the scenic route: measuring the value of search trails in web logs
Search trails mined from browser or toolbar logs comprise queries and the post-query pages that users visit. Implicit endorsements from many trails can be useful for search result...
Ryen W. White, Jeff Huang
BMCBI
2006
172views more  BMCBI 2006»
13 years 7 months ago
BioWarehouse: a bioinformatics database warehouse toolkit
Background: This article addresses the problem of interoperation of heterogeneous bioinformatics databases. Results: We introduce BioWarehouse, an open source toolkit for construc...
Thomas J. Lee, Yannick Pouliot, Valerie Wagner, Pr...