Sciweavers

1686 search results - page 196 / 338
» Programs as polygraphs: computability and complexity
Sort
View
POS
1998
Springer
15 years 8 months ago
Spatio-temporal Access in Persistent Java
Persistent programming languages are targetted primarily at application systems involving complex data structures and relationships, as typi ed by Geographical Information Systems...
Sonia Berman, R. Southern, A. Vasey, D. Ziskind
DAS
2006
Springer
15 years 7 months ago
Exploratory Analysis System for Semi-structured Engineering Logs
Engineering diagnosis often involves analyzing complex records of system states printed to large, textual log files. Typically the logs are designed to accommodate the widest debug...
Michael Flaster, Bruce Hillyer, Tin Kam Ho
WSC
1997
15 years 5 months ago
Simulation of Modern Parallel Systems: A CSIM-based Approach
Components of modern parallel systems are becoming quite complex with many features and variations. An integrated modeling of these components (interconnection network, messaging ...
Dhabaleswar K. Panda, Debashis Basak, Donglai Dai,...
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 4 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
CVIU
2011
14 years 7 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...