Sciweavers

1058 search results - page 5 / 212
» It's Doomed; We Can Prove It
Sort
View
CP
2005
Springer
14 years 3 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
Grégoire Dooms, Yves Deville, Pierre Dupont
CAI
2009
Springer
13 years 7 months ago
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
This paper studies conditions under which the operation of parallel insertion can be reversed by parallel deletion, i.e., when does the equality (L1 L2) L2 = L1 hold for language...
Bo Cui, Lila Kari, Shinnosuke Seki
JAT
2006
66views more  JAT 2006»
13 years 9 months ago
An extrapolation theorem for nonlinear approximation and its applications
We prove an extrapolation theorem for the nonlinear m-term approximation with respect to a system of functions satisfying very mild conditions. This theorem allows us to prove end...
Feng Dai
MP
2006
134views more  MP 2006»
13 years 9 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
FPL
2007
Springer
105views Hardware» more  FPL 2007»
14 years 4 months ago
An Execution Model for Hardware/Software Compilation and its System-Level Realization
We introduce a new execution model for orchestrating the interaction between the conventional processor and the reconfigurable compute unit in adaptive computer systems. We then ...
Holger Lange, Andreas Koch