Sciweavers

2485 search results - page 441 / 497
» Time Bounded Frequency Computations
Sort
View
PAMI
2006
164views more  PAMI 2006»
13 years 7 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
IJON
2007
93views more  IJON 2007»
13 years 7 months ago
How much can we trust neural simulation strategies?
Despite a steady improvement of computational hardware, results of numerical simulation are still tightly bound to the simulation tool and strategy used, and may substantially var...
Michelle Rudolph, Alain Destexhe
JALC
2007
79views more  JALC 2007»
13 years 7 months ago
Two-Way Finite Automata with a Write-Once Track
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
Berke Durak
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 7 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
JAR
2000
90views more  JAR 2000»
13 years 7 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter