Sciweavers

2681 search results - page 20 / 537
» Problem F
Sort
View
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
14 years 6 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...
IPL
2008
114views more  IPL 2008»
13 years 8 months ago
Faster algorithms for guided tree edit distance
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
Dekel Tsur
MOC
2000
105views more  MOC 2000»
13 years 8 months ago
On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
Jin Qi-nian
INTERACT
2007
13 years 10 months ago
Face-to-Face Sociability Signs Made Explicit in CMC
This paper discusses how semiotic engineering can support the formulation of problems and solutions involved in handling face-to-face (F2F) sociability models in computer-mediated ...
Carla Faria Leitão, Clarisse Sieckenius de ...