Sciweavers

619 search results - page 39 / 124
» A dynamical systems approach to weighted graph matching
Sort
View
APVIS
2006
13 years 9 months ago
Mental map preserving graph drawing using simulated annealing
Information visualization has attracted much attention in recent years in many fields of science and engineering. In many applications, graphs are `dynamic' in the sense that...
Yi-Yi Lee, Chun-Cheng Lin, Hsu-Chun Yen
ICPR
2006
IEEE
14 years 8 months ago
Quality-based Score Level Fusion in Multibiometric Systems
The quality of biometric samples has a significant impact on the accuracy of a matcher. Poor quality biometric samples often lead to incorrect matching results because the feature...
Anil K. Jain, Karthik Nandakumar, Sarat C. Dass, Y...
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
14 years 8 days ago
Using memetic algorithms to improve portfolio performance in static and dynamic trading scenarios
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...
Claus de Castro Aranha, Hitoshi Iba
DAM
2007
107views more  DAM 2007»
13 years 7 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
ICCV
2007
IEEE
13 years 9 months ago
Ten-fold Improvement in Visual Odometry Using Landmark Matching
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...
Zhiwei Zhu, Taragay Oskiper, Supun Samarasekera, R...