601 search results - page 16 / 121 » Quantified Equality Constraints |
104
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
HOTI
2008
IEEE
15 years 7 months ago
2008
IEEE
Several types of low power passive equalizer is proposed and optimized in this work. The equalizer topologies include T-junction, parallel R-C and series R-L structures. These str...
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
The use of bit-patterned media is one of the approaches being investigated to extend magnetic recording densities to 1 Tbit/in2 and beyond. In patterned media, track pitch may be s...
109
click to vote
TWC
2011
14 years 7 months ago
2011
Most of the existing literature on cooperative relay networks has focused on frequency– nonselective channels or frequency–selective channels with multi–carrier transmission...
115
click to vote
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...