Sciweavers

779 search results - page 8 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...
118
Voted
CVPR
2009
IEEE
16 years 4 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu
PAKDD
2005
ACM
94views Data Mining» more  PAKDD 2005»
15 years 3 months ago
Progressive Sampling for Association Rules Based on Sampling Error Estimation
We explore in this paper a progressive sampling algorithm, called Sampling Error Estimation (SEE), which aims to identify an appropriate sample size for mining association rules. S...
Kun-Ta Chuang, Ming-Syan Chen, Wen-Chieh Yang
CVPR
2007
IEEE
15 years 11 months ago
Multiple Class Segmentation Using A Unified Framework over Mean-Shift Patches
Object-based segmentation is a challenging topic. Most of the previous algorithms focused on segmenting a single or a small set of objects. In this paper, the multiple class objec...
Lin Yang, Peter Meer, David J. Foran
HPCC
2007
Springer
15 years 1 months ago
Energy-Aware Online Algorithm to Satisfy Sampling Rates with Guaranteed Probability for Sensor Applications
Abstract. Energy consumption is a major factor that limits the performance of sensor applications. Sensor nodes have varying sampling rates since they face continuously changing en...
Meikang Qiu, Edwin Hsing-Mean Sha