Sciweavers

4313 search results - page 344 / 863
» Using time travel to diagnose computer problems
Sort
View
CVPR
2007
IEEE
16 years 9 months ago
Online Spatial-temporal Data Fusion for Robust Adaptive Tracking
One problem with the adaptive tracking is that the data that are used to train the new target model often contain errors and these errors will affect the quality of the new target...
Jixu Chen, Qiang Ji
FOCI
2007
IEEE
16 years 1 months ago
Faster Evolutionary Algorithms by Superior Graph Representation
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Benjamin Doerr, Christian Klein, Tobias Storch
SGAI
2004
Springer
16 years 27 days ago
A combinatorial approach to conceptual graph projection checking
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
Madalina Croitoru, Ernesto Compatangelo
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
16 years 11 days ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 years 5 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson