ICCV
2011
IEEE
13 years 13 days ago
2011
IEEE
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...
CSC
2010
13 years 7 months ago
2010
- 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...
IEEEHPCS
2010
13 years 10 months ago
2010
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...
BIBM
2010
IEEE
13 years 10 months ago
2010
IEEE
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...
TSP
2008
14 years 9 days ago
2008
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...
CORR
2007
Springer
14 years 12 days ago
2007
Springer
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...
EOR
2006
14 years 13 days ago
2006
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...
BMCBI
2006
14 years 14 days ago
2006
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...
AROBOTS
2006
14 years 15 days ago
2006
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...
CORR
2008
Springer
14 years 15 days ago
2008
Springer
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...