Sciweavers

1722 search results - page 28 / 345
» On the sample mean of graphs
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 10 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
IPPS
1998
IEEE
15 years 2 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman
CVPR
2005
IEEE
16 years 15 hour ago
Efficient Mean-Shift Tracking via a New Similarity Measure
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
BMCBI
2010
118views more  BMCBI 2010»
14 years 10 months ago
Testing for mean and correlation changes in microarray experiments: an application for pathway analysis
Background: Microarray experiments examine the change in transcript levels of tens of thousands of genes simultaneously. To derive meaningful data, biologists investigate the resp...
Mayer Alvo, Zhongzhu Liu, Andrew Williams, Carole ...
GIS
1998
ACM
14 years 9 months ago
Mean-Variance Analysis of the Performance of Spatial Ordering Methods
Geographical Information Systems (GIS) involve the manipulation of large spatial data sets, and the performance of these systems is often determined by how these data sets are orga...
Akhil Kumar, Waleed A. Muhanna, Raymond A. Patters...