Sciweavers

ICCV
2011
IEEE
12 years 11 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
CSC
2010
13 years 6 months ago
Performance Modeling, Analysis, and Optimization of Cell-List Based Molecular Dynamics
- We have developed a performance prediction model for non-bonded interaction computations in molecular dynamics simulations, thereby predicting the optimal cell dimension in a lin...
Manaschai Kunaseth, Rajiv K. Kalia, Aiichiro Nakan...
IEEEHPCS
2010
13 years 9 months ago
Fast learning for multibiometrics systems using genetic algorithms
The performance (in term of error rate) of biometric systems can be improved by combining them. Multiple fusion techniques can be applied from classical logical operations to more...
Romain Giot, Mohamad El-Abed, Christophe Rosenberg...
BIBM
2010
IEEE
156views Bioinformatics» more  BIBM 2010»
13 years 9 months ago
Truncation of protein sequences for fast profile alignment with application to subcellular localization
We have recently found that the computation time of homology-based subcellular localization can be substantially reduced by aligning profiles up to the cleavage site positions of s...
Man-Wai Mak, Wei Wang, Sun-Yuan Kung
TSP
2008
158views more  TSP 2008»
13 years 11 months ago
High-Speed VLSI Implementation of 2-D Discrete Wavelet Transform
This paper presents a systematic high-speed VLSI implementation of the discrete wavelet transform (DWT) based on hardware-efficient parallel FIR filter structures. High-speed 2-D D...
Chao Cheng, Keshab K. Parhi
CORR
2007
Springer
123views Education» more  CORR 2007»
13 years 11 months ago
On Distributed Computation in Noisy Random Planar Networks
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Yashodhan Kanoria, D. Manjunath
EOR
2006
118views more  EOR 2006»
13 years 11 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
BMCBI
2006
194views more  BMCBI 2006»
13 years 11 months ago
Novel metaheuristic for parameter estimation in nonlinear dynamic biological systems
Background: We consider the problem of parameter estimation (model calibration) in nonlinear dynamic models of biological systems. Due to the frequent ill-conditioning and multi-m...
Maria Rodriguez-Fernandez, Jose A. Egea, Julio R. ...
AROBOTS
2006
95views more  AROBOTS 2006»
13 years 11 months ago
Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping
This article presents a very efficient SLAM algorithm that works by hierarchically dividing a map into local regions and subregions. At each level of the hierarchy each region sto...
Udo Frese
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 11 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...