Sciweavers

9842 search results - page 1566 / 1969
» Problem complexity
Sort
View
ESTIMEDIA
2009
Springer
16 years 1 months ago
System-level MP-SoC design space exploration using tree visualization
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...
Toktam Taghavi, Andy D. Pimentel, Mark Thompson
FMCAD
2009
Springer
16 years 1 months ago
Scaling VLSI design debugging with interpolation
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
Brian Keng, Andreas G. Veneris
FSTTCS
2009
Springer
16 years 1 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
16 years 1 months ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula
ICB
2009
Springer
119views Biometrics» more  ICB 2009»
16 years 1 months ago
Multi-Region Probabilistic Histograms for Robust and Scalable Identity Inference
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
Conrad Sanderson, Brian C. Lovell
« Prev « First page 1566 / 1969 Last » Next »