Sciweavers

6110 search results - page 300 / 1222
» Approximate Computing
Sort
View
ECCC
2000
158views more  ECCC 2000»
15 years 6 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
187
Voted
IJSI
2010
84views more  IJSI 2010»
15 years 5 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
KSEM
2009
Springer
16 years 1 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
CHI
1997
ACM
15 years 11 months ago
Performance Differences in the Fingers, Wrist, and Forearm in Computer Input Control
Recent work in computer input control has sought to maximize the use of the fingers in the operation of computer pointing devices. The main rationale is the hypothesis that the m...
Ravin Balakrishnan, I. Scott MacKenzie
COMPGEOM
2000
ACM
15 years 11 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...