Sciweavers

564 search results - page 12 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
14 years 8 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 7 months ago
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
K. Murali Krishnan, Priti Shankar
CVPR
2012
IEEE
11 years 10 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...
PAA
2008
13 years 7 months ago
Distance-based discriminant analysis method and its applications
This paper proposes a method of finding a discriminative linear transformation that enhances the data's degree of conformance to the compactness hypothesis and its inverse. Th...
Serhiy Kosinov, Thierry Pun
VLDB
2007
ACM
117views Database» more  VLDB 2007»
14 years 8 months ago
RadixZip: Linear-Time Compression of Token Streams
RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix so...
Binh Vo, Gurmeet Singh Manku