Sciweavers

4313 search results - page 371 / 863
» Using time travel to diagnose computer problems
Sort
View
SPIRE
2005
Springer
16 years 1 months ago
An Edit Distance Between RNA Stem-Loops
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...
Valentin Guignon, Cedric Chauve, Sylvie Hamel
168
Voted
TSMC
2008
136views more  TSMC 2008»
15 years 7 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
194
Voted
JACM
2000
119views more  JACM 2000»
15 years 7 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
188
Voted
JOC
2011
81views more  JOC 2011»
15 years 2 months ago
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The fin...
Andreas Enge, Pierrick Gaudry, Emmanuel Thom&eacut...
COMGEO
2008
ACM
15 years 7 months ago
Covering point sets with two disjoint disks or squares
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
Sergio Cabello, José Miguel Díaz-B&a...