Sciweavers

5658 search results - page 37 / 1132
» An Efficient Counting Network
Sort
View
FAST
2010
14 years 7 days ago
Discovery of Application Workloads from Network File Traces
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level he...
Neeraja J. Yadwadkar, Chiranjib Bhattacharyya, K. ...
DAC
2003
ACM
14 years 3 months ago
Test generation for designs with multiple clocks
To improve the system performance, designs with multiple clocks have become more and more popular. In this paper, several novel test generation procedures are proposed to utilize ...
Xijiang Lin, Rob Thompson
CPC
2006
93views more  CPC 2006»
13 years 10 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
LREC
2010
155views Education» more  LREC 2010»
13 years 11 months ago
Efficient Minimal Perfect Hash Language Models
The recent availability of large collections of text such as the Google 1T 5-gram corpus (Brants and Franz, 2006) and the Gigaword corpus of newswire (Graff, 2003) have made it po...
David Guthrie, Mark Hepple, Wei Liu
ICIP
2009
IEEE
14 years 11 months ago
Efficient Poisson Denoising For Photography
In general, image sensor noise is dominated by Poisson statistics, even at high illumination level, yet most standard denoising procedures often assume a simpler additive Gaussian...