Sciweavers

2211 search results - page 318 / 443
» Comparing Approaches to Implement Feature Model Composition
Sort
View
ICRA
2005
IEEE
152views Robotics» more  ICRA 2005»
14 years 2 months ago
Dynamic Vehicle Localization using Constraints Propagation Techniques on Intervals A comparison with Kalman Filtering
-In order to implement a continuous and robust dynamic localization of a mobile robot, the fusion of dead reckoning and absolute sensors is often used. Depending on the objectives ...
Amadou Gning, Philippe Bonnifait
ICCV
2009
IEEE
1824views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the Euclidean distance to cluster features into visual...
Jianxin Wu, James M. Rehg
EVOW
2006
Springer
14 years 17 days ago
Optimisation of Constant Matrix Multiplication Operation Hardware Using a Genetic Algorithm
Abstract. The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems. Prev...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
BMCBI
2005
158views more  BMCBI 2005»
13 years 8 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
WSDM
2010
ACM
322views Data Mining» more  WSDM 2010»
14 years 6 months ago
Inferring Search Behaviors Using Partially Observable Markov (POM) Model
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
Kuansan Wang, Nikolas Gloy, Xiaolong Li