Sciweavers

276 search results - page 34 / 56
» The Complexity of Computing Maximal Word Functions
Sort
View
DAC
1996
ACM
13 years 11 months ago
Bit-Level Analysis of an SRT Divider Circuit
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
Randal E. Bryant
NPL
2000
99views more  NPL 2000»
13 years 7 months ago
On the Internal Representations of Product Units
This paper explores internal representation power of product units [1] that act as the functional nodes in the hidden layer of a multi-layer feedforward network. Interesting proper...
Jung-Hua Wang, Yi-Wei Yu, Jia-Horng Tsai
RTCSA
2005
IEEE
14 years 1 months ago
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
TSP
2008
109views more  TSP 2008»
13 years 7 months ago
Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
ECCV
2010
Springer
13 years 11 months ago
Exploring Ambiguities for Monocular Non-Rigid Shape Estimation
Recovering the 3D shape of deformable surfaces from single images is difficult because many different shapes have very similar projections. This is commonly addressed by restricti...