Sciweavers

2489 search results - page 284 / 498
» On the Subgroup Distance Problem
Sort
View
139
Voted
BMCBI
2010
86views more  BMCBI 2010»
15 years 4 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
ICDM
2010
IEEE
276views Data Mining» more  ICDM 2010»
15 years 2 months ago
Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
Doruk Sart, Abdullah Mueen, Walid A. Najjar, Eamon...
ICCV
2007
IEEE
16 years 6 months ago
A Unified and Efficient Approach for Free-form Deformable Registration
We propose a novel numerical approach for solving the free-form deformable registration problem. The central idea is to utilize the well understood techniques from variational def...
Ali Khamene, Fred S. Azar, Loren Arthur Schwarz, D...
ICML
2004
IEEE
16 years 5 months ago
Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model
Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
MDM
2009
Springer
123views Communications» more  MDM 2009»
15 years 11 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...