Sciweavers

341 search results - page 59 / 69
» Quantum Computation and Lattice Problems
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Fast, Quality, Segmentation of Large Volumes - Isoperimetric Distance Trees
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
Leo Grady
DGCI
2006
Springer
13 years 11 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg
DAM
1999
128views more  DAM 1999»
13 years 7 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
ASAP
2008
IEEE
182views Hardware» more  ASAP 2008»
14 years 2 months ago
Low-cost implementations of NTRU for pervasive security
NTRU is a public-key cryptosystem based on the shortest vector problem in a lattice which is an alternative to RSA and ECC. This work presents a compact and low power NTRU design ...
Ali Can Atici, Lejla Batina, Junfeng Fan, Ingrid V...
LICS
2006
IEEE
14 years 1 months ago
On Tractability and Congruence Distributivity
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
Emil W. Kiss, Matthew Valeriote