Sciweavers

341 search results - page 62 / 69
» Quantum Computation and Lattice Problems
Sort
View
JCAM
2011
91views more  JCAM 2011»
12 years 10 months ago
Numerical solution of linear Volterra integral equations of the second kind with sharp gradients
Collocation methods are a well developed approach for the numerical solution of smooth and weakly-singular Volterra integral equations. In this paper we extend these methods, thro...
Samuel A. Isaacson, Robert M. Kirby
CVPR
2001
IEEE
14 years 9 months ago
Generic Model Abstraction from Examples
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
Yakov Keselman, Sven J. Dickinson
IPCO
1992
112views Optimization» more  IPCO 1992»
13 years 8 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
JCB
1998
105views more  JCB 1998»
13 years 7 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
CASES
2006
ACM
14 years 1 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