Sciweavers

79 search results - page 16 / 16
» Linear programming bounds for unitary space time codes
Sort
View
CORR
2006
Springer
109views Education» more  CORR 2006»
14 years 9 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
14 years 9 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
80
Voted
SIGSOFT
2003
ACM
15 years 10 months ago
Deadline analysis of interrupt-driven software
Real-time, reactive, and embedded systems are increasingly used throughout society (e.g., flight control, railway signaling, vehicle management, medical devices, and many others)....
Dennis Brylow, Jens Palsberg
NIPS
2007
14 years 11 months ago
Receptive Fields without Spike-Triggering
Stimulus selectivity of sensory neurons is often characterized by estimating their receptive field properties such as orientation selectivity. Receptive fields are usually deriv...
Jakob Macke, Guenther Zeck, Matthias Bethge