Sciweavers

1435 search results - page 111 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
ETT
2006
102views Education» more  ETT 2006»
14 years 10 months ago
Bit-interleaved coded irregular modulation
We consider a simple method to improve the adaptiveness and flexibility of bit-interleaved coded modulation (BICM) for various channel models. With state-of-the art adaptive transm...
Frank Schreckenbach, Gerhard Bauch
ASPLOS
2010
ACM
15 years 4 months ago
Virtualized and flexible ECC for main memory
We present a general scheme for virtualizing main memory errorcorrection mechanisms, which map redundant information needed to correct errors into the memory namespace itself. We ...
Doe Hyun Yoon, Mattan Erez
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
15 years 11 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
15 years 4 months ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
3DIM
2003
IEEE
15 years 3 months ago
Reliable and Rapidly-Converging ICP Algorithm Using Multiresolution Smoothing
Autonomous range acquisition for 3D modeling requires reliable range registration, for both the precise localization of the sensor and combining the data from multiple scans for v...
Kok-Lim Low, Anselmo Lastra