Sciweavers

2157 search results - page 99 / 432
» Optimal Fast Hashing
Sort
View
MICCAI
2010
Springer
15 years 2 months ago
Fast Random Walker with Priors Using Precomputation for Interactive Medical Image Segmentation
Abstract. Updating segmentation results in real-time based on repeated user input is a reliable way to guarantee accuracy, paramount in medical imaging applications, while making e...
Shawn Andrews, Ghassan Hamarneh, Ahmed Saad
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 8 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
ISPD
2012
ACM
248views Hardware» more  ISPD 2012»
13 years 12 months ago
A fast estimation of SRAM failure rate using probability collectives
Importance sampling is a popular approach to estimate rare event failures of SRAM cells. We propose to improve importance sampling by probability collectives. First, we use “Kul...
Fang Gong, Sina Basir-Kazeruni, Lara Dolecek, Lei ...
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
13 years 6 months ago
Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection
— In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which i...
Junfeng Zhou, Zhifeng Bao, Wei Wang, Tok Wang Ling...
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
15 years 11 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic