4934 search results - page 66 / 987 » complexity 2008 |
134
click to vote
JAIR
2008
15 years 3 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
114
Voted
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Recently M¨uller et al. (IEEE J. Select. Areas Commun. 2008) used asymptotic methods from statistical physics to analyze non-linear vector precoding for MIMO broadcast ...
111
click to vote
AMC
2008
15 years 3 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
110
Voted
TCSV
2002
15 years 3 months ago
2002
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
129
click to vote
TCS
2008
15 years 3 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...