Sciweavers

9209 search results - page 388 / 1842
» Data Space Randomization
Sort
View
EUROMICRO
1999
IEEE
15 years 11 months ago
A Selective Compressed Memory System by On-Line Data Decompressing
This research proposes a selective compressed memory system (SCMS) focusing on a compressed cache architecture, in which only data blocks with good compression efficiency are comp...
Jang-Soo Lee, Won-Kee Hong, Shin-Dug Kim
ICVGIP
2004
15 years 8 months ago
Modeling Signs Using Functional Data Analysis
1 We present a functional data analysis (FDA) based method to statistically model continuous signs of the American Sign Language (ASL) for use in the recognition of signs in contin...
Sunita Nayak, Sudeep Sarkar, Kuntal Sengupta
ICMLA
2010
15 years 4 months ago
Boosting Multi-Task Weak Learners with Applications to Textual and Social Data
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...
Jean Baptiste Faddoul, Boris Chidlovskii, Fabien T...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 7 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
16 years 1 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes