Sciweavers

461 search results - page 45 / 93
» Splitting NP-Complete Sets
Sort
View
DM
2010
96views more  DM 2010»
13 years 11 months ago
On well-rounded sublattices of the hexagonal lattice
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
Lenny Fukshansky, Daniel Moore, R. Andrew Ohana, W...
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 11 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
CSDA
2007
148views more  CSDA 2007»
13 years 11 months ago
Classifying densities using functional regression trees: Applications in oceanology
The problem of building a regression tree is considered when the response variable is a probability density function. Splitting criteria which are well adapted to measure the diss...
David Nerini, Badih Ghattas
JUCS
2008
159views more  JUCS 2008»
13 years 11 months ago
Two Step Swarm Intelligence to Solve the Feature Selection Problem
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
Yudel Gómez, Rafael Bello, Amilkar Puris, M...
ORL
2008
111views more  ORL 2008»
13 years 11 months ago
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel