Sciweavers

588 search results - page 67 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
DAC
1997
ACM
14 years 2 months ago
Quadratic Placement Revisited
The “quadratic placement” methodology is rooted in [6] [14] [16] and is reputedly used in many commercial and in-house tools for placement of standard-cell and gate-array desi...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
WABI
2009
Springer
130views Bioinformatics» more  WABI 2009»
14 years 4 months ago
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
SPAA
2010
ACM
13 years 8 months ago
Managing the complexity of lookahead for LU factorization with pivoting
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
Ernie Chan, Robert A. van de Geijn, Andrew Chapman
ECCV
2010
Springer
14 years 3 months ago
Maximum Margin Distance Learning for Dynamic Texture Recognition
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
ICANN
1997
Springer
14 years 1 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer