Sciweavers

1071 search results - page 130 / 215
» Programming with enumerable sets of structures
Sort
View
97
Voted
FIW
2009
101views Communications» more  FIW 2009»
14 years 10 months ago
Feature Interaction Detection in the Feature Language Extensions
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
Lei Sun, Lu Zhoa, Yimeng Li, Wu-Hon F. Leung
ESOP
2011
Springer
14 years 4 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
WIKIS
2009
ACM
15 years 7 months ago
Incremental knowledge acquisition in software development using a weakly-typed Wiki
Software development is a knowledge-intensive activity and frequently implies a progressive crystallization of knowledge, towards programming language statements. Although wikis h...
Filipe Figueiredo Correia, Hugo Sereno Ferreira, N...
ICMCS
2006
IEEE
243views Multimedia» more  ICMCS 2006»
15 years 6 months ago
A Comparison of Three 3-D Facial Reconstruction Approaches
We compare three Computer Vision approaches to 3-D reconstruction, namely passive Binocular Stereo and active Structured Lighting and Photometric Stereo, in application to human f...
Alexander Woodward, Da An, Georgy L. Gimel'farb, P...
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 2 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...