2778 search results - page 137 / 556 » Limit complexities revisited |
158
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
175
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
Voltage scheduling is indispensable for exploiting the benefit of variable voltage processors. Though extensive research has been done in this area, current processor limitations...
165
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Many computer vision problems rely on computing histogram-based objective functions with a sliding window. A main limiting factor is the high computational cost. Existing computat...
164
click to vote
ICASSP
2008
IEEE
16 years 26 days ago
2008
IEEE
In multiuser detection, the set of users active at any time may be unknown to the receiver. A two-step detection procedure, in which multiuser detection is preceded by active-user...
183
click to vote
ICC
2008
IEEE
16 years 26 days ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...