Sciweavers

219 search results - page 15 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
ASAP
2008
IEEE
105views Hardware» more  ASAP 2008»
13 years 9 months ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou...
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn
JCP
2006
98views more  JCP 2006»
13 years 7 months ago
Backward Coding of Wavelet Trees with Fine-grained Bitrate Control
Backward Coding of Wavelet Trees (BCWT) is an extremely fast wavelet-tree-based image coding algorithm. Utilizing a unique backward coding algorithm, BCWT also provides a rich set ...
Jiangling Guo, Sunanda Mitra, Brian Nutter, Tanja ...
CIKM
2008
Springer
13 years 9 months ago
Pairwise statistical significance of local sequence alignment using multiple parameter sets
Background: Accurate estimation of statistical significance of a pairwise alignment is an important problem in sequence comparison. Recently, a comparative study of pairwise stati...
Ankit Agrawal, Xiaoqiu Huang
CVPR
2007
IEEE
14 years 9 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára