Sciweavers

231 search results - page 22 / 47
» Sublinear time approximate clustering
Sort
View
SSD
2005
Springer
173views Database» more  SSD 2005»
14 years 29 days ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
ANNPR
2008
Springer
13 years 9 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi
IJSYSC
2010
97views more  IJSYSC 2010»
13 years 6 months ago
A stability study on first-order neutral systems with three rationally independent time delays
— First order linear time invariant and time delayed dynamics of neutral type is taken into account with three rationally independent delays. There are two main contributions of ...
Rifat Sipahi, Nejat Olgaç, Dimitri Breda
ICDE
2005
IEEE
185views Database» more  ICDE 2005»
14 years 8 months ago
A Multiresolution Symbolic Representation of Time Series
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
Vasileios Megalooikonomou, Qiang Wang, Guo Li, Chr...
VLSID
1993
IEEE
133views VLSI» more  VLSID 1993»
13 years 11 months ago
An Area-Efficient Systolic Architecture for Real-Time VLSI Finite Impulse Response Filters
An area-eficzent systolic architecture for realtime, programmable-coeBcient jinite impulse response (FIR)filters is presented. A technique called pipelined clustering is introduce...
V. Visvanathan, Nibedita Mohanty, S. Ramanathan