Sciweavers

1541 search results - page 263 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Iterative MAP and ML Estimations for Image Segmentation
Image segmentation plays an important role in computer vision and image analysis. In this paper, the segmentation problem is formulated as a labeling problem under a probability m...
Shifeng Chen, Liangliang Cao, Jianzhuang Liu, Xiao...
ICCV
1999
IEEE
14 years 10 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg
DAC
2005
ACM
14 years 9 months ago
A non-parametric approach for dynamic range estimation of nonlinear systems
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
Bin Wu, Jianwen Zhu, Farid N. Najm
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 8 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 5 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...