2370 search results - page 194 / 474 » The Characterization of Data-Accumulating Algorithms |
91
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— We address data transmission over the M-user Gaussian interference channel, where users send data using single Gaussian codebooks. We first present a polynomial-time algorithm...
100
click to vote
DAM
2007
15 years 3 months ago
2007
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid point or the grid cube model. Th...
144
Voted
JMLR
2006
15 years 3 months ago
2006
This paper proposes a general probabilistic framework for shape-based modeling and classification of waveform data. A segmental hidden Markov model (HMM) is used to characterize w...
140
Voted
TSP
2008
15 years 3 months ago
2008
The focus of this paper is on VLIW instruction scheduling that minimizes the variation of power consumed by the processor during the execution of a target program. We use rough set...
115
Voted
CSL
2002
Springer
15 years 3 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...