Sciweavers

19866 search results - page 222 / 3974
» Computing all factorizations in ***
Sort
View
ISMIS
2005
Springer
16 years 3 days ago
Normal Forms for Knowledge Compilation
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
Reiner Hähnle, Neil V. Murray, Erik Rosenthal
ICPR
2002
IEEE
15 years 11 months ago
Multilinear Image Analysis for Facial Recognition
Natural images are the composite consequence of multiple factors related to scene structure, illumination, and imaging. For facial images, the factors include different facial geo...
M. Alex O. Vasilescu, Demetri Terzopoulos
ISCA
2010
IEEE
413views Hardware» more  ISCA 2010»
15 years 11 months ago
Resistive computation: avoiding the power wall with low-leakage, STT-MRAM based computing
As CMOS scales beyond the 45nm technology node, leakage concerns are starting to limit microprocessor performance growth. To keep dynamic power constant across process generations...
Xiaochen Guo, Engin Ipek, Tolga Soyata
TOMS
2011
101views more  TOMS 2011»
15 years 1 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
SMA
2003
ACM
120views Solid Modeling» more  SMA 2003»
15 years 12 months ago
Three-dimensional halfspace constructive solid geometry tree construction from implicit boundary representations
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
Suzanne F. Buchele, Richard H. Crawford