Sciweavers

2006 search results - page 169 / 402
» Heuristic Security-Testing Methods
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 6 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
BMCBI
2007
153views more  BMCBI 2007»
15 years 2 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
215
Voted
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 2 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
147
Voted
WABI
2010
Springer
178views Bioinformatics» more  WABI 2010»
15 years 25 days ago
Haplotype Inference on Pedigrees with Recombinations and Mutations
Abstract. Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functional genomics, pharmacogenetics and population ge...
Yuri Pirola, Paola Bonizzoni, Tao Jiang
112
Voted
CVPR
2000
IEEE
16 years 4 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi