Sciweavers

1422 search results - page 224 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
14 years 8 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
LCTRTS
2009
Springer
15 years 4 months ago
A compiler optimization to reduce soft errors in register files
Register file (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing c...
Jongeun Lee, Aviral Shrivastava
IDA
2006
Springer
14 years 9 months ago
Backward chaining rule induction
Exploring the vast number of possible feature interactions in domains such as gene expression microarray data is an onerous task. We describe Backward-Chaining Rule Induction (BCR...
Douglas H. Fisher, Mary E. Edgerton, Zhihua Chen, ...
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
15 years 4 months ago
Graph-based robust shape matching for robotic application
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
Hanbyul Joo, Yekeun Jeong, Olivier Duchenne, Seong...
WEBDB
2010
Springer
155views Database» more  WEBDB 2010»
15 years 2 months ago
Learning Topical Transition Probabilities in Click Through Data with Regression Models
The transition of search engine users’ intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how di...
Xiao Zhang, Prasenjit Mitra