2767 search results - page 99 / 554 » Universal Exponentiation Algorithm |
110
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
120
click to vote
ASPDAC
2004
ACM
15 years 7 months ago
2004
ACM
With the exponential reduction in the scaling of feature size, inter-wire coupling capacitance becomes the dominant part of load capacitance. Two problems are introduced by coupli...
91
Voted
AAAI
2008
15 years 4 months ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
120
click to vote
AICOM
2004
15 years 2 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
110
click to vote
VTC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—In this paper we present reduced-complexity highperformance receivers for single-user MIMO systems that employ coded OFDM transmission with bit-interleaved coded modulat...