Sciweavers

1533 search results - page 299 / 307
» Semantic Matching: Algorithms and Implementation
Sort
View
POPL
2010
ACM
16 years 21 days ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
KBSE
2009
IEEE
15 years 10 months ago
Static Validation of C Preprocessor Macros
—The widely used C preprocessor (CPP) is generally considered a source of difficulty for understanding and maintaining C/C++ programs. The main reason for this difficulty is CP...
Andreas Saebjoernsen, Lingxiao Jiang, Daniel J. Qu...
CGO
2008
IEEE
15 years 9 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
MIR
2005
ACM
197views Multimedia» more  MIR 2005»
15 years 8 months ago
Enhanced ontologies for video annotation and retrieval
A typical way to perform video annotation requires to classify video elements (e.g. events and objects) according to some pre-defined ontology of the video content domain. Ontolo...
Marco Bertini, Alberto Del Bimbo, Carlo Torniai
136
Voted
ADAEUROPE
2003
Springer
15 years 8 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney