Sciweavers

4039 search results - page 708 / 808
» A Method for Dynamic Clustering of Data
Sort
View
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 4 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
SIGMOD
2003
ACM
121views Database» more  SIGMOD 2003»
16 years 4 months ago
An environmental sensor network to determine drinking water quality and security
Finding patterns in large, real, spatio/temporal data continues to attract high interest (e.g., sales of products over space and time, patterns in mobile phone users; sensor netwo...
Anastassia Ailamaki, Christos Faloutsos, Paul S. F...
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
15 years 10 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
SIGMOD
2005
ACM
113views Database» more  SIGMOD 2005»
15 years 9 months ago
Robust and Fast Similarity Search for Moving Object Trajectories
An important consideration in similarity-based retrieval of moving object trajectories is the definition of a distance function. The existing distance functions are usually sensi...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
ASYNC
2003
IEEE
100views Hardware» more  ASYNC 2003»
15 years 9 months ago
Congestion and Starvation Detection in Ripple FIFOs
High-speed asynchronous ripple FIFOs may be easily embedded in synchronous environments and can elegantly handle the problem of forwarding data between clock domains. In cases whe...
William S. Coates, Robert J. Drost