Sciweavers

1117 search results - page 100 / 224
» Equivalent Representations of Set Functions
Sort
View
ICFP
2010
ACM
14 years 10 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal
CVPR
2010
IEEE
15 years 5 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
SERVICES
2008
95views more  SERVICES 2008»
14 years 11 months ago
Multiobjective Optimization of SLA-Aware Service Composition
In Service Oriented Architecture, each application is ofgned as a set of abstract services, which defines its functions. A concrete service(s) is selected at runtime for tract ser...
Hiroshi Wada, Paskorn Champrasert, Junichi Suzuki,...
BIBE
2006
IEEE
132views Bioinformatics» more  BIBE 2006»
15 years 3 months ago
Simplicity in RNA Secondary Structure Alignment: Towards biologically plausible alignments
Ribonucleic acid (RNA) molecules contain the genetic information that regulates the functions of organisms. Given two different molecules, a preserved function corresponds to a pr...
Rimon Mikhaiel, Guohui Lin, Eleni Stroulia
IOLTS
2008
IEEE
83views Hardware» more  IOLTS 2008»
15 years 4 months ago
On the Minimization of Potential Transient Errors and SER in Logic Circuits Using SPFD
Sets of Pairs of Functions to be Distinguished (SPFD) is a functional flexibility representation method that was recently introduced in the logic synthesis domain, and promises s...
Sobeeh Almukhaizim, Yiorgos Makris, Yu-Shen Yang, ...