2333 search results - page 358 / 467 » Recursive Computational Depth |
VIS
2009
IEEE
14 years 9 months ago
2009
IEEE
Stackless traversal techniques are often used to circumvent memory bottlenecks by avoiding a stack and replacing return traversal with extra computation. This paper addresses wheth...
DAC
2003
ACM
14 years 9 months ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
IPMI
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. This paper presents a novel method of optimizing pointbased correspondence among populations of human cortical surfaces by combining structural cues with probabilistic co...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
For the last few years we have studied the diffusion of private information about users as they visit various Web sites triggering data gathering aggregation by third parties. Thi...
CADE
2002
Springer
14 years 8 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...