Sciweavers

831 search results - page 43 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 10 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu
WICON
2010
13 years 8 months ago
On Infostation Density of Vehicular Networks
Vehicle-to-Vehicle and Vehicle-to-Roadside communications are going to become an indispensable part of the modern day automotive experience. For people on the move, vehicular netwo...
Vinod Kone, Haitao Zheng, Antony I. T. Rowstron, B...
PPOPP
2003
ACM
14 years 3 months ago
Exploiting high-level coherence information to optimize distributed shared state
InterWeave is a distributed middleware system that supports the sharing of strongly typed, pointer-rich data structures across a wide variety of hardware architectures, operating ...
DeQing Chen, Chunqiang Tang, Brandon Sanders, Sand...
ICPR
2002
IEEE
14 years 11 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
RECOMB
2006
Springer
14 years 10 months ago
Evolution of Tandemly Repeated Sequences Through Duplication and Inversion
Abstract. Given a phylogenetic tree T for a family of tandemly repeated genes and their signed order O on the chromosome, we aim to find the minimum number of inversions compatible...
Denis Bertrand, Mathieu Lajoie, Nadia El-Mabrouk, ...