Sciweavers

1187 search results - page 144 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
COMPGEOM
2010
ACM
15 years 3 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
PAMI
2011
14 years 4 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
ISCA
2008
IEEE
188views Hardware» more  ISCA 2008»
15 years 4 months ago
MIRA: A Multi-layered On-Chip Interconnect Router Architecture
Recently, Network-on-Chip (NoC) architectures have gained popularity to address the interconnect delay problem for designing CMP / multi-core / SoC systems in deep sub-micron tech...
Dongkook Park, Soumya Eachempati, Reetuparna Das, ...
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 1 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
BMCBI
2008
160views more  BMCBI 2008»
14 years 10 months ago
Feature selection environment for genomic applications
Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e....
Fabrício Martins Lopes, David Correa Martin...