Sciweavers

1170 search results - page 7 / 234
» How Fast Is Too Fast
Sort
View
DAC
1996
ACM
14 years 3 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 3 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
CGO
2009
IEEE
14 years 5 months ago
Fast Track: A Software System for Speculative Program Optimization
—Fast track is a software speculation system that enables unsafe optimization of sequential code. It speculatively runs optimized code to improve performance and then checks the ...
Kirk Kelsey, Tongxin Bai, Chen Ding, Chengliang Zh...
JVM
2004
103views Education» more  JVM 2004»
14 years 7 days ago
The Virtual Processor: Fast, Architecture-Neutral Dynamic Code Generation
Tools supporting dynamic code generation tend too be low-level (leaving much work to the client application) or too intimately related with the language/system in which they are u...
Ian Piumarta
VISSYM
2003
14 years 6 days ago
ISOSLIDER: A System for Interactive Exploration of Isosurfaces
We present ISOSLIDER, a system for interactive exploration of isosurfaces of a scalar field. Our algorithm focuses on fast update of isosurfaces for interactive display as a user...
Jatin Chhugani, Sudhir Vishwanath, Jonathan D. Coh...