Sciweavers

250 search results - page 34 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
CAV
2009
Springer
133views Hardware» more  CAV 2009»
15 years 10 months ago
Cardinality Abstraction for Declarative Networking Applications
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
Andrey Rybalchenko, Atul Singh, Juan Antonio Navar...
ICALP
2009
Springer
15 years 4 months ago
Assigning Papers to Referees
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
Kurt Mehlhorn
ESOP
2007
Springer
15 years 3 months ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter
CGF
2007
113views more  CGF 2007»
14 years 9 months ago
Real-time homogenous translucent material editing
This paper presents a novel method for real-time homogenous translucent material editing under fixed illumination. We consider the complete analytic BSSRDF model proposed by Jens...
Kun Xu, Yue Gao, Yong Li, Tao Ju, Shi-Min Hu
ISDA
2009
IEEE
15 years 4 months ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...