Sciweavers

192 search results - page 32 / 39
» Internal consistency for embedding complexity
Sort
View
ICDM
2003
IEEE
101views Data Mining» more  ICDM 2003»
14 years 18 min ago
Interactive Visualization and Navigation in Large Data Collections using the Hyperbolic Space
We propose the combination of two recently introduced methods for the interactive visual data mining of large collections of data. Both, Hyperbolic Multi-Dimensional Scaling (HMDS...
Jörg A. Walter, Jörg Ontrup, Daniel Wess...
CIKM
2008
Springer
13 years 8 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
TVLSI
2008
187views more  TVLSI 2008»
13 years 6 months ago
A Design Flow for Architecture Exploration and Implementation of Partially Reconfigurable Processors
During the last years, the growing application complexity, design, and mask costs have compelled embedded system designers to increasingly consider partially reconfigurable applica...
Kingshuk Karuri, Anupam Chattopadhyay, Xiaolin Che...
BMVC
2010
13 years 4 months ago
Iterative Hyperplane Merging: A Framework for Manifold Learning
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
Harry Strange, Reyer Zwiggelaar
ACNS
2009
Springer
193views Cryptology» more  ACNS 2009»
14 years 1 months ago
Cryptanalysis of Twister
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
Florian Mendel, Christian Rechberger, Martin Schl&...