Sciweavers

274 search results - page 17 / 55
» Counting lattice vectors
Sort
View
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
15 years 6 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala
CASES
2006
ACM
15 years 5 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
FOCS
2002
IEEE
15 years 4 months ago
Quantum Computation and Lattice Problems
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
Oded Regev
CVPR
2010
IEEE
15 years 4 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince
BMCBI
2008
88views more  BMCBI 2008»
14 years 11 months ago
Use of machine learning algorithms to classify binary protein sequences as highly-designable or poorly-designable
Background: By using a standard Support Vector Machine (SVM) with a Sequential Minimal Optimization (SMO) method of training, Na
Myron Peto, Andrzej Kloczkowski, Vasant Honavar, R...