Sciweavers

22 search results - page 3 / 5
» A linear space algorithm for computing a longest common incr...
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 9 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
IFIP
2004
Springer
14 years 22 days ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
13 years 5 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...
ICPR
2004
IEEE
14 years 8 months ago
Extraction and Clustering of Motion Trajectories in Video
A system is described that tracks moving objects in a video dataset so as to extract a representation of the objects' 3D trajectories. The system then finds hierarchical clus...
Dan Buzan, George Kollios, Stan Sclaroff
AIHC
2007
Springer
14 years 1 months ago
Trajectory-Based Representation of Human Actions
This work addresses the problem of human action recognition by introducing a representation of a human action as a collection of short trajectories that are extracted in areas of ...
Antonios Oikonomopoulos, Ioannis Patras, Maja Pant...