Sciweavers

2463 search results - page 94 / 493
» Compressing Pattern Databases
Sort
View
ICMCS
2008
IEEE
138views Multimedia» more  ICMCS 2008»
14 years 5 months ago
Using H.264 coded block patterns for fast inter-mode selection
The support of variable block-sizes, though significantly improves the compression efficiency, imposes a big computational challenge on an H.264 encoder. In this paper, we present...
Bo-Yuan Chen, Shih-Hsuan Yang
ICCV
2011
IEEE
12 years 10 months ago
Local Intensity Order Pattern for Feature Description
This paper presents a novel method for feature description based on intensity order. Specifically, a Local Intensity Order Pattern(LIOP) is proposed to encode the local ordinal i...
Zhenhua Wang, Bin Fan, Fuchao Wu
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 11 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
ICIP
2009
IEEE
14 years 11 months ago
Selective And Scalable Encryption Of Enhancement Layers For Dyadic Scalable H.264/avc By Scrambling Of Scan Patterns
This paper presents a new selective and scalable encryption (SSE) method for intra dyadic scalable coding framework based on wavelet/subband (DWTSB) for H.264/AVC. It has been ach...
BMCBI
2010
132views more  BMCBI 2010»
13 years 11 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...