Sciweavers

593 search results - page 20 / 119
» An approach to benchmarking configuration complexity
Sort
View
ET
2000
80views more  ET 2000»
13 years 7 months ago
A New Method for Testing Re-Programmable PLAs
: We present a method for obtaining a minimal set of test configurations and their associated set oftest patterns that completely tests re-programmable Programmable Logic Arrays (P...
Charles E. Stroud, James R. Bailey, Johan R. Emmer...
ROBIO
2006
IEEE
110views Robotics» more  ROBIO 2006»
14 years 1 months ago
Demand-Driven Development of Parallel Robots with Adaptronic Components by a Modular System
Abstract - Parallel robots provide high stiffness, accelerations and accuracy. They are relatively complex products that are specialized to a specific problem. Normally a new robot...
Carsten Stechert, Nenad Pavlovic, Hans-Joachim Fra...
ML
2002
ACM
128views Machine Learning» more  ML 2002»
13 years 7 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
MICCAI
2007
Springer
14 years 8 months ago
Object Localization Based on Markov Random Fields and Symmetry Interest Points
We present an approach to detect anatomical structures by configurations of interest points, from a single example image. The representation of the configuration is based on Markov...
Branislav Micusík, Georg Langs, Horst Bisch...
IMR
2003
Springer
14 years 20 days ago
Meshing Complexity of Single Part CAD Models
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
David R. White, Sunil Saigal, Steven J. Owen