Sciweavers

3394 search results - page 139 / 679
» A Space and Time Efficient Algorithm for SimRank Computation
Sort
View
RECOMB
2007
Springer
14 years 8 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
ICDCS
1999
IEEE
14 years 8 days ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
GIS
2006
ACM
14 years 9 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
SIAMADS
2010
63views more  SIAMADS 2010»
13 years 2 months ago
Time Integration and Steady-State Continuation for 2d Lubrication Equations
Lubrication equations describe many structuring processes of thin liquid films. We develop and apply a numerical framework suitable for their analysis employing a dynamical systems...
Philippe Beltrame, Uwe Thiele
CG
2006
Springer
13 years 11 months ago
Monte-Carlo Proof-Number Search for Computer Go
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
Jahn-Takeshi Saito, Guillaume Chaslot, Jos W. H. M...