2542 search results - page 190 / 509 » Computing Cartograms with Optimal Complexity |
99
Voted
ICPR
2008
IEEE
16 years 2 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...
106
Voted
ISCC
2008
IEEE
15 years 7 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...
124
Voted
STACS
2005
Springer
15 years 6 months 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 ...
136
click to vote
COMPGEOM
2010
ACM
15 years 5 months 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. ...
122
click to vote
NIPS
2007
15 years 2 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...