Sciweavers

340 search results - page 20 / 68
» Clustering with Lower Bound on Similarity
Sort
View
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
15 years 2 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
ICC
2007
IEEE
125views Communications» more  ICC 2007»
15 years 3 months ago
Scalable Fault Diagnosis in IP Networks using Graphical Models: A Variational Inference Approach
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
Rajesh Narasimha, Souvik Dihidar, Chuanyi Ji, Stev...
CORR
2002
Springer
95views Education» more  CORR 2002»
14 years 9 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
ICCV
2009
IEEE
1119views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Spectral clustering of linear subspaces for motion segmentation
This paper studies automatic segmentation of multiple motions from tracked feature points through spectral embedding and clustering of linear subspaces. We show that the dimensi...
Fabien Lauer, Christoph Schn¨orr
99
Voted
ICPADS
2006
IEEE
15 years 3 months ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...