Sciweavers

430 search results - page 33 / 86
» Extracting Computer Algebra Programs from Statements
Sort
View
TRIER
2002
13 years 7 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
DB
2008
107views more  DB 2008»
13 years 7 months ago
Introducing function extraction into software testing
Software testing can benefit from technologies that enable evolution toward increased engineering discipline. In current practice, software developers lack practical means to dete...
Mark G. Pleszkoch, Richard C. Linger, Alan R. Hevn...
FM
2009
Springer
123views Formal Methods» more  FM 2009»
14 years 2 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
ICCV
2011
IEEE
12 years 7 months ago
Discovering Object Instances from Scenes of Daily Living
We propose an approach to identify and segment objects from scenes that a person (or robot) encounters in Activities of Daily Living (ADL). Images collected in those cluttered sce...
Hongwen Kang, Martial Hebert, Takeo Kanade