1331 search results - page 210 / 267 » Complexity bounds for zero-test algorithms |
SIGMOD
2003
ACM
15 years 10 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
VTC
2006
IEEE
15 years 3 months ago
2006
IEEE
— We present a low complexity adaptive transmission approach for spatially correlated MIMO channels. The proposed scheme adaptively switches between orthogonal space-time block c...
VISUALIZATION
1999
IEEE
15 years 2 months ago
1999
IEEE
We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a sce...
NIPS
2007
14 years 11 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
DAGSTUHL
2006
14 years 11 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...