Sciweavers

4403 search results - page 403 / 881
» Galois Theory of Algorithms
Sort
View
COMPGEOM
2007
ACM
15 years 10 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
164
Voted
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
15 years 10 months ago
Configuring an evolutionary tool for the inventory and transportation problem
EVITA, standing for Evolutionary Inventory and Transportation Algorithm, aims to be a commercial tool to address the problem of minimising both the transport and inventory costs o...
Anna Esparcia-Alcázar, Lidia Lluch-Revert, ...
166
Voted
CSB
2004
IEEE
106views Bioinformatics» more  CSB 2004»
15 years 10 months ago
A Theoretical Analysis of Gene Selection
A great deal of recent research has focused on the challenging task of selecting differentially expressed genes from microarray data (`gene selection'). Numerous gene selecti...
Sach Mukherjee, Stephen J. Roberts
166
Voted
EUROCRYPT
2006
Springer
15 years 10 months ago
Symplectic Lattice Reduction and NTRU
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguye...
164
Voted
AAAI
2008
15 years 9 months ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner