Sciweavers

564 search results - page 55 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 2 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
14 years 27 days ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
ICA
2010
Springer
13 years 10 months ago
Blind Source Separation Based on Time-Frequency Sparseness in the Presence of Spatial Aliasing
In this paper, we propose a novel method for blind source separation (BSS) based on time-frequency sparseness (TF) that can estimate the number of sources and time-frequency masks,...
Benedikt Loesch, Bin Yang
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
13 years 10 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
14 years 3 months ago
Clustering Distributed Time Series in Sensor Networks
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-sh...
Jie Yin, Mohamed Medhat Gaber