Sciweavers

6365 search results - page 266 / 1273
» Fast Local Computation Algorithms
Sort
View
ACL
2012
13 years 9 months ago
Fast and Robust Part-of-Speech Tagging Using Dynamic Model Selection
This paper presents a novel way of improving POS tagging on heterogeneous data. First, two separate models are trained (generalized and domain-specific) from the same data set by...
Jinho D. Choi, Martha Palmer
KDD
2003
ACM
162views Data Mining» more  KDD 2003»
16 years 7 months ago
Improving spatial locality of programs via data mining
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...
Karlton Sequeira, Mohammed Javeed Zaki, Boleslaw K...
ICIP
2008
IEEE
16 years 1 months ago
Detection of +/-1 LSB steganography based on the amplitude of histogram local extrema
Recently Zhang et al described an algorithm for the detection of ±1 LSB steganography based on the statistics of the amplitudes of local extrema in the greylevel histogram. Exper...
Giacomo Cancelli, Gwenaël J. Doërr, Inge...
ICCD
2006
IEEE
117views Hardware» more  ICCD 2006»
16 years 3 months ago
Fast, Performance-Optimized Partial Match Address Compression for Low-Latency On-Chip Address Buses
— The influence of interconnects on processor performance and cost is becoming increasingly pronounced with technology scaling. In this paper, we present a fast compression sche...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 6 months ago
Fast GPGPU Data Rearrangement Kernels using CUDA
: Many high performance computing algorithms are bandwidth limited, hence the need for optimal data rearrangement kernels as well as their easy integration into the rest of the app...
Michael Bader, Hans-Joachim Bungartz, Dheevatsa Mu...