Sciweavers

882 search results - page 98 / 177
» On self-embeddings of computable linear orderings
Sort
View
JGO
2010
100views more  JGO 2010»
14 years 4 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
SIAMREV
2010
170views more  SIAMREV 2010»
14 years 4 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham
EMSOFT
2006
Springer
15 years 1 months ago
Time-triggered implementations of dynamic controllers
Bridging the gap between model-based design and platformbased implementation is one of the critical challenges for embedded software systems. In the context of embedded control sy...
Truong Nghiem, George J. Pappas, Rajeev Alur, Anto...
ICIP
1999
IEEE
15 years 11 months ago
Color Constancy from Multispectral Images
This paper describes a computational method for estimating the body reflectance function of color surfaces. The experimental apparatus consists of a vision system having seven spe...
Andrea Abrardo, Luciano Alparone, Vito Cappellini,...
POPL
2008
ACM
15 years 10 months ago
A logical account of pspace
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...