5981 search results - page 384 / 1197 » time 2006 |
174
click to vote
IPL
2000
15 years 6 months ago
2000
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
166
click to vote
IPL
2000
15 years 6 months ago
2000
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
209
click to vote
IVC
2000
15 years 6 months ago
2000
We present a fast, robust, and low cost pupil detection technique that uses two near infra red time multiplexed light sources synchronized with the camera frame rate. The two ligh...
164
click to vote
ET
2002
15 years 6 months ago
2002
Specification reduction can reduce test time, consequently, test cost. In this paper, a methodology to reduce specifications during specification testing for analog circuit is prop...
174
click to vote
JCB
2000
15 years 6 months ago
2000
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...