909 search results - page 28 / 182 » Relational bytecode correlations |
CSB
2003
IEEE
15 years 3 months ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
TIT
2011
14 years 5 months ago
2011
— The focus of this paper is on spatial precoding in correlated multi-antenna channels where the number of datastreams is adapted independent of the number of transmit antennas. ...
STACS
2010
Springer
15 years 5 months ago
2010
Springer
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— Scan matching, the problem of registering two laser scans in order to determine the relative positions from which the scans were obtained, is one of the most heavily relied-upo...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we consider time-and-frequency hopping (TFH) codes for optical code-division multiple-access (OCDMA) networks. To support the differentiated service requirements...