Sciweavers

79 search results - page 11 / 16
» Exploiting N-Gram Analysis to Predict Operator Sequences
Sort
View
DAC
2004
ACM
14 years 7 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...
BMVC
2000
13 years 8 months ago
A New Method for Computing Optical Flow
Accurate and high density estimation of optical flow vectors in an image sequence is accomplished by a method that estimates the velocity distribution function for small overlappi...
W. F. Clocksin
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
13 years 10 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
ALMOB
2008
95views more  ALMOB 2008»
13 years 6 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
CHI
2002
ACM
14 years 7 months ago
Automating CPM-GOMS
CPM-GOMS is a modeling method that combines the task decomposition of a GOMS analysis with a model of human resource usage at the level of cognitive, perceptual, and motor operati...
Bonnie E. John, Alonso H. Vera, Michael Matessa, M...