2542 search results - page 190 / 509 » Computing Cartograms with Optimal Complexity |
181
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
178
Voted
ISCC
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
211
Voted
STACS
2005
Springer
16 years 15 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
244
click to vote
COMPGEOM
2010
ACM
16 years 2 days ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
202
Voted
NIPS
2007
15 years 8 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...