Sciweavers

1101 search results - page 110 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
CASC
2007
Springer
108views Mathematics» more  CASC 2007»
15 years 5 months ago
Comprehensive Triangular Decomposition
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
Changbo Chen, Oleg Golubitsky, François Lem...
3DIM
2005
IEEE
15 years 5 months ago
A MRF Formulation for Coded Structured Light
Multimedia projectors and cameras make possible the use of structured light to solve problems such as 3D reconstruction, disparity map computation and camera or projector calibrat...
Jean-Philippe Tardif, Sébastien Roy
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
15 years 3 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 22 hour ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ECBS
2009
IEEE
106views Hardware» more  ECBS 2009»
15 years 6 months ago
Extensibility and Modularity for Model Driven Engineering Environments
Model Driven Engineering has shown the feasibility to generate tools (editors, analyzers …) from models and for a domain. Unfortunately these generated tools are much focused wh...
Thomas Leveque, Jacky Estublier, Germán Veg...