1795 search results - page 232 / 359 » On the Complexity of Circuit Satisfiability |
104
Voted
VISUALIZATION
1999
IEEE
15 years 5 months ago
1999
IEEE
We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a sce...
124
click to vote
SOFSEM
1999
Springer
15 years 5 months ago
1999
Springer
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
ICDT
2010
ACM
15 years 4 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
ASIACRYPT
2006
Springer
15 years 4 months ago
2006
Springer
At CRYPTO2005, Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin proposed a collision attack on SHA-0 that could generate a collision with complexity 239 SHA-0 hash operations. Although t...
112
click to vote
FM
2006
Springer
15 years 4 months ago
2006
Springer
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...