Sciweavers

2191 search results - page 173 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
KSEM
2010
Springer
15 years 4 months ago
A Formalism for Causal Explanations with an Answer Set Programming Translation
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
Yves Moinard
CAP
2010
15 years 1 months ago
A high-performance algorithm for calculating cyclotomic polynomials
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
Andrew Arnold, Michael B. Monagan
DAC
2005
ACM
16 years 7 months ago
Incremental exploration of the combined physical and behavioral design space
Achieving design closure is one of the biggest headaches for modern VLSI designers. This problem is exacerbated by high-level design automation tools that ignore increasingly impo...
Zhenyu (Peter) Gu, Jia Wang, Robert P. Dick, Hai Z...
CVPR
2008
IEEE
16 years 8 months ago
Integrated feature selection and higher-order spatial feature extraction for object categorization
In computer vision, the bag-of-visual words image representation has been shown to yield good results. Recent work has shown that modeling the spatial relationship between visual ...
David Liu, Gang Hua, Paul A. Viola, Tsuhan Chen
FCCM
2007
IEEE
108views VLSI» more  FCCM 2007»
16 years 16 days ago
Configurable Transactional Memory
Programming efficiency of heterogeneous concurrent systems is limited by the use of lock-based synchronization mechanisms. Transactional memories can greatly improve the programmi...
Christoforos Kachris, Chidamber Kulkarni