Sciweavers

6575 search results - page 702 / 1315
» Specializing visualization algorithms
Sort
View
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 7 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
CVIU
2010
198views more  CVIU 2010»
15 years 7 months ago
Non-Gaussian model-based fusion of noisy images in the wavelet domain
This paper describes a new methodology for multimodal image fusion based on non-Gaussian statistical modelling of wavelet coefficients. Special emphasis is placed on the fusion of...
Artur Loza, David R. Bull, Nishan Canagarajah, Ali...
EJC
2010
15 years 7 months ago
Combinatorial characterization of the Assur graphs from engineering
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...
Brigitte Servatius, Offer Shai, Walter Whiteley
213
Voted
ECCC
2008
98views more  ECCC 2008»
15 years 7 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
146
Voted
ENDM
2008
61views more  ENDM 2008»
15 years 7 months ago
Diameter and Curvature: Intriguing Analogies
We highlight intriguing analogies between the diameter of a polytope and the largest possible total curvature of the associated central path. We prove continuous analogues of the ...
Antoine Deza, Tamás Terlaky, Feng Xie, Yuri...