Sciweavers

621 search results - page 113 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 19 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
ICS
2010
Tsinghua U.
14 years 5 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
MOBIHOC
2010
ACM
13 years 5 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
BMCBI
2010
160views more  BMCBI 2010»
13 years 2 months ago
eHive: An Artificial Intelligence workflow system for genomic analysis
Background: The Ensembl project produces updates to its comparative genomics resources with each of its several releases per year. During each release cycle approximately two week...
Jessica Severin, Kathryn Beal, Albert J. Vilella, ...
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 8 months ago
Data Stream Clustering: Challenges and Issues
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
Madjid Khalilian, Norwati Mustapha