Sciweavers

556 search results - page 60 / 112
» Pair Programming: Not for Everyone
Sort
View
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 9 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
CVIU
2008
109views more  CVIU 2008»
13 years 9 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
NAR
2008
119views more  NAR 2008»
13 years 9 months ago
MALISAM: a database of structurally analogous motifs in proteins
MALISAM (manual alignments for structurally analogous motifs) represents the first database containing pairs of structural analogs and their alignments. To find reliable analogs, ...
Hua Cheng, Bong-Hyun Kim, Nick V. Grishin
CORR
2010
Springer
315views Education» more  CORR 2010»
13 years 4 months ago
Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks
Abstract--Based on the false assumption that multicast incapable (MI) nodes could not be traversed twice on the same wavelength, the light-tree structure was always thought to be o...
Fen Zhou, Miklós Molnár, Bernard Cou...
CAISE
2009
Springer
14 years 3 months ago
Declarative versus Imperative Process Modeling Languages: The Issue of Understandability
Advantages and shortcomings of different process modeling languages are heavily debated, both in academia and industry, but little evidence is presented to support judgements. Wit...
Dirk Fahland, Daniel Lübke, Jan Mendling, Haj...