Sciweavers

105 search results - page 10 / 21
» Fast mesh segmentation using random walks
Sort
View
MICCAI
2007
Springer
14 years 8 months ago
Robust Computation of Mutual Information Using Spatially Adaptive Meshes
Abstract. We present a new method for the fast and robust computation of information theoretic similarity measures for alignment of multi-modality medical images. The proposed meth...
Hari Sundar, Dinggang Shen, George Biros, Chenyang...
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
13 years 9 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
ACL
2010
13 years 5 months ago
Jointly Optimizing a Two-Step Conditional Random Field Model for Machine Transliteration and Its Fast Decoding Algorithm
This paper presents a joint optimization method of a two-step conditional random field (CRF) model for machine transliteration and a fast decoding algorithm for the proposed metho...
Dong Yang, Paul R. Dixon, Sadaoki Furui
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 2 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
GRAPHICSINTERFACE
2007
13 years 9 months ago
Spectral graph-theoretic approach to 3D mesh watermarking
We propose a robust and imperceptible spectral watermarking method for high rate embedding of a watermark into 3D polygonal meshes. Our approach consists of four main steps: (1) t...
Emad E. Abdallah, A. Ben Hamza, Prabir Bhattachary...