Sciweavers

41 search results - page 8 / 9
» Fast Algorithms for Sorting and Searching Strings
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 10 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
SI3D
2009
ACM
14 years 1 months ago
Perceptually consistent example-based human motion retrieval
Large amount of human motion capture data have been increasingly recorded and used in animation and gaming applications. Efficient retrieval of logically similar motions from a l...
Zhigang Deng, Qin Gu, Qing Li
SSDBM
2003
IEEE
141views Database» more  SSDBM 2003»
13 years 11 months ago
The ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. ...
SIGIR
2008
ACM
13 years 6 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
INFOSCALE
2007
ACM
13 years 8 months ago
Scalable problem localization for distributed systems: principles and practices
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
Rui Zhang, Bruno C. d. S. Oliveira, Alan Bivens, S...