Sciweavers

1998 search results - page 99 / 400
» Complexity of the Cover Polynomial
Sort
View
WSCG
2004
166views more  WSCG 2004»
13 years 11 months ago
Non-evaluated Manipulation of Complex CSG Solids
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
Rafael Jesús Segura, Francisco R. Feito, Ju...
IJON
2007
114views more  IJON 2007»
13 years 10 months ago
A cell assembly model for complex behaviour
Hebbian cell assemblies have been proposed as a model for cortical processing able to bridge between physiology and psychology. Assembly-based theories focused mainly on represent...
Thomas Wennekers
JC
2000
138views more  JC 2000»
13 years 9 months ago
Multivariate Polynomials, Duality, and Structured Matrices
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Bernard Mourrain, Victor Y. Pan
KR
2004
Springer
14 years 3 months ago
Inferential Complexity Control for Model-Based Abduction
We describe a technique for speeding up inference for model-based abduction tasks that trades off inference time and/or space for the fraction of queries correctly answered. We co...
Gregory M. Provan
ICCAD
1996
IEEE
144views Hardware» more  ICCAD 1996»
14 years 2 months ago
Validation coverage analysis for complex digital designs
The functional validation of a state-of-the-art digital design is usually performed by simulation of a register-transfer-level model. The degree to which the testvector suite cove...
Richard C. Ho, Mark Horowitz