Sciweavers

1448 search results - page 60 / 290
» From Requirements to Code Revisited
Sort
View
CORR
2006
Springer
96views Education» more  CORR 2006»
13 years 10 months ago
Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Po...
MSR
2011
ACM
13 years 27 days ago
Modeling the evolution of topics in source code histories
Studying the evolution of topics (collections of co-occurring words) in a software project is an emerging technique to automatically shed light on how the project is changing over...
Stephen W. Thomas, Bram Adams, Ahmed E. Hassan, Do...
HICSS
2007
IEEE
212views Biometrics» more  HICSS 2007»
14 years 4 months ago
Fully-automatic generation of user interfaces for multiple devices from a high-level model based on communicative acts
The problems involved in the development of user interfaces become even more severe through the ubiquitous use of a variety of devices such as PCs, mobile phones and PDAs. Each of...
Jürgen Falb, Roman Popp, Thomas Röck, He...
BMCBI
2008
114views more  BMCBI 2008»
13 years 10 months ago
Combining classifiers for improved classification of proteins from sequence or structure
Background: Predicting a protein's structural or functional class from its amino acid sequence or structure is a fundamental problem in computational biology. Recently, there...
Iain Melvin, Jason Weston, Christina S. Leslie, Wi...
ENTCS
2006
153views more  ENTCS 2006»
13 years 10 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu