Sciweavers

4560 search results - page 412 / 912
» Finding Data in the Neighborhood
Sort
View
CHES
2010
Springer
210views Cryptology» more  CHES 2010»
15 years 8 months ago
Flash Memory 'Bumping' Attacks
This paper introduces a new class of optical fault injection attacks called bumping attacks. These attacks are aimed at data extraction from secure embedded memory, which usually s...
Sergei Skorobogatov
IS
2008
15 years 6 months ago
Continuous subspace clustering in streaming time series
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clust...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
JMLR
2006
206views more  JMLR 2006»
15 years 6 months ago
New Algorithms for Efficient High-Dimensional Nonparametric Classification
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
Ting Liu, Andrew W. Moore, Alexander G. Gray
PAMI
2007
166views more  PAMI 2007»
15 years 6 months ago
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
TVCG
2010
217views more  TVCG 2010»
15 years 5 months ago
How Information Visualization Novices Construct Visualizations
—It remains challenging for information visualization novices to rapidly construct visualizations during exploratory data analysis. We conducted an exploratory laboratory study i...
Lars Grammel, Melanie Tory, Margaret-Anne D. Store...