Sciweavers

1805 search results - page 238 / 361
» Functional programming with structured graphs
Sort
View
RE
2004
Springer
15 years 6 months ago
From Goals to Aspects: Discovering Aspects from Requirements Goal Models
Aspect-oriented programming (AOP) has been attracting much attention in the Software Engineering community by advocating that programs should be structured according to programmer...
Yijun Yu, Julio Cesar Sampaio do Prado Leite, John...
FIMH
2009
Springer
15 years 8 months ago
Cardiac Fibre Trace Clustering for the Interpretation of the Human Heart Architecture
Cardiac fibre architecture plays a key role in heart function. Recently, the estimation of fibre structure has been simplified with diffusion tensor MRI (DT-MRI). In order to as...
Carole Frindel, Marc C. Robini, Joël Schaerer...
98
Voted
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
15 years 1 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
107
Voted
IPCO
2010
148views Optimization» more  IPCO 2010»
15 years 3 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ASPLOS
2011
ACM
14 years 5 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...