Sciweavers

2313 search results - page 340 / 463
» On Heuristic Time Hierarchies
Sort
View
BMCBI
2011
14 years 10 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
ICCAD
2003
IEEE
141views Hardware» more  ICCAD 2003»
15 years 11 months ago
An Enhanced Multilevel Algorithm for Circuit Placement
This paper presents several important enhancements to the recently published multilevel placement package mPL [12]. The improvements include (i) unconstrained quadratic relaxation...
Tony F. Chan, Jason Cong, Tim Kong, Joseph R. Shin...
ICCV
2009
IEEE
16 years 11 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl
CVPR
2007
IEEE
16 years 8 months ago
Linear and Quadratic Subsets for Template-Based Tracking
We propose a method that dramatically improves the performance of template-based matching in terms of size of convergence region and computation time. This is done by selecting a ...
Selim Benhimane, Alexander Ladikos, Vincent Lepeti...
ICDE
2009
IEEE
132views Database» more  ICDE 2009»
16 years 8 months ago
Using Anonymized Data for Classification
In recent years, anonymization methods have emerged as an important tool to preserve individual privacy when releasing privacy sensitive data sets. This interest in anonymization t...
Ali Inan, Murat Kantarcioglu, Elisa Bertino