Sciweavers

CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 8 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 8 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 8 months ago
The Parallel-Sequential Duality : Matrices and Graphs
Abstract. Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove t...
Serge Burckel
CORR
2007
Springer
96views Education» more  CORR 2007»
13 years 8 months ago
New Complexity Bounds for Certain Real Fewnomial Zero Sets
d Abstract) Frederic Bihan∗ Joel Gomez† Andrew Niles‡ J. Maurice Rojas§ January 24, 2007 Rojas dedicates this paper to his friend, Professor Tien-Yien Li. Consider real biv...
Joel Gomez, Andrew Niles, J. Maurice Rojas
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 8 months ago
CD(4) has bounded width
We prove that the constraint languages invariant under a short sequence of J´onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they h...
Catarina Carvalho, Víctor Dalmau, Petar Mar...
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 8 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Double Clustering and Graph Navigability
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
Oskar Sandberg
CORR
2007
Springer
150views Education» more  CORR 2007»
13 years 8 months ago
Composable Security in the Bounded-Quantum-Storage Model
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...
Stephanie Wehner, Jürg Wullschleger
CORR
2007
Springer
63views Education» more  CORR 2007»
13 years 8 months ago
Navigability of Complex Networks
Marián Boguñá, Dmitri V. Krio...
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 8 months ago
The Extended Edit Distance Metric
Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers re...
Muhammad Marwan Muhammad Fuad, Pierre-Francois Mar...