Sciweavers

2434 search results - page 73 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
141
Voted
TSP
2008
151views more  TSP 2008»
15 years 3 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 3 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
137
Voted
PTS
2010
134views Hardware» more  PTS 2010»
15 years 1 months ago
A Learning-Based Approach to Unit Testing of Numerical Software
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
Karl Meinke, Fei Niu
HIPC
2009
Springer
15 years 1 months ago
Optimizing the use of GPU memory in applications with large data sets
Abstract--With General Purpose programmable GPUs becoming more and more popular, automated tools are needed to bridge the gap between achievable performance from highly parallel ar...
Nadathur Satish, Narayanan Sundaram, Kurt Keutzer
TROB
2010
83views more  TROB 2010»
15 years 1 months ago
Passive-Set-Position-Modulation Framework for Interactive Robotic Systems
—We propose a novel framework, passive set-position modulation (PSPM), which enables us to connect a (continuoustime) robot’s position to a sequence of slowly-updating/sparse (...
Dongjun Lee, Ke Huang