Sciweavers

1280 search results - page 48 / 256
» Soft Typing with Conditional Types
Sort
View
ARSCOM
2005
106views more  ARSCOM 2005»
13 years 9 months ago
Chromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
Stephen Guattery, Gary Haggard, Ronald C. Read
COMBINATORICS
2004
103views more  COMBINATORICS 2004»
13 years 9 months ago
On the Counting of Fully Packed Loop Configurations: Some New Conjectures
New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures a...
Jean-Bernard Zuber
ICANN
2007
Springer
14 years 28 days ago
Classifying EEG Data into Different Memory Loads Across Subjects
Abstract. In this paper we consider the question of whether it is possible to classify n-back EEG data into different memory loads across subjects. To capture relevant information ...
Liang Wu, Predrag Neskovic
BIRTHDAY
2003
Springer
14 years 2 months ago
Fair Equivalence Relations
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
DATE
2010
IEEE
185views Hardware» more  DATE 2010»
14 years 2 months ago
Fault diagnosis of analog circuits based on machine learning
— We discuss a fault diagnosis scheme for analog integrated circuits. Our approach is based on an assemblage of learning machines that are trained beforehand to guide us through ...
Ke Huang, Haralampos-G. D. Stratigopoulos, Salvado...