Sciweavers

906 search results - page 42 / 182
» Language and program design for functional dependencies
Sort
View
VISSOFT
2005
IEEE
14 years 4 months ago
The Dominance Tree in Visualizing Software Dependencies
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
Raimar Falke, Raimund Klein, Rainer Koschke, Joche...
ENTCS
2006
168views more  ENTCS 2006»
13 years 10 months ago
A Functional Programming Framework for Latency Insensitive Protocol Validation
Latency insensitive protocols (LIPs) have been proposed as a viable means to connect synchronous IP blocks via long interconnects in a system-on-chip. The reason why one needs to ...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla...
PAMI
2010
168views more  PAMI 2010»
13 years 9 months ago
Nonnegative Least-Correlated Component Analysis for Separation of Dependent Sources by Volume Maximization
—Although significant efforts have been made in developing nonnegative blind source separation techniques, accurate separation of positive yet dependent sources remains a challen...
Fa-Yu Wang, Chong-Yung Chi, Tsung-Han Chan, Yue Wa...
AI
2009
Springer
14 years 5 months ago
Novice-Friendly Natural Language Generation Template Authoring Environment
Abstract. Natural Language Generation (NLG) systems can make data accessible in an easily digestible textual form; but using such systems requires sophisticated linguistic and some...
Maria Fernanda Caropreso, Diana Inkpen, Shahzad Kh...
BIRTHDAY
2010
Springer
13 years 11 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka