Sciweavers

475 search results - page 22 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
TKDE
2011
332views more  TKDE 2011»
14 years 8 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
AAAI
2010
15 years 3 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
15 years 10 months ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
APVIS
2003
15 years 3 months ago
A Scalable Method for Visualising Changes in Portfolio Data
In this paper techniques from multidimensional scaling and graph drawing are coupled to provide an overview-and-detail style method for visualising a high dimensional dataset whos...
Tim Dwyer
119
Voted
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 11 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...