Sciweavers

8431 search results - page 179 / 1687
» Algorithmically Independent Sequences
Sort
View
COMPGEOM
2011
ACM
14 years 6 months ago
On the structure and composition of forbidden sequences, with geometric applications
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Seth Pettie
FPL
2005
Springer
136views Hardware» more  FPL 2005»
15 years 8 months ago
Architecture-Adaptive Routability-Driven Placement for FPGAs
Current FPGA placement algorithms estimate the routability of a placement using architecture-specific metrics. The shortcoming of using architecture-specific routability estimates ...
Akshay Sharma, Carl Ebeling, Scott Hauck
115
Voted
ARC
2007
Springer
123views Hardware» more  ARC 2007»
15 years 6 months ago
Multiple Sequence Alignment Using Reconfigurable Computing
The alignment of multiple protein (or DNA) sequences is a current problem in Bioinformatics. ClustalW is the most popular heuristic algorithm for multiple sequence alignment. Pairw...
Carlos R. Erig Lima, Heitor S. Lopes, Maiko R. Mor...
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
15 years 8 months ago
Fast camera calibration for the analysis of sport sequences
Semantic analysis of sport sequences requires camera calibration to obtain player and ball positions in real-world coordinates. For court sports like tennis, the marker lines on t...
Dirk Farin, Jungong Han, Peter H. N. de With
BMCBI
2006
80views more  BMCBI 2006»
15 years 2 months ago
Quantification of the variation in percentage identity for protein sequence alignments
Background: Percentage Identity (PID) is frequently quoted in discussion of sequence alignments since it appears simple and easy to understand. However, although there are several...
G. P. S. Raghava, Geoffrey J. Barton