Sciweavers

1071 search results - page 106 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
JLP
2007
114views more  JLP 2007»
13 years 8 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
CHI
2011
ACM
12 years 12 months ago
Bricolage: example-based retargeting for web design
The Web provides a corpus of design examples unparalleled in human history. However, leveraging existing designs to produce new pages is often difficult. This paper introduces th...
Ranjitha Kumar, Jerry O. Talton, Salman Ahmad, Sco...
CORR
2004
Springer
144views Education» more  CORR 2004»
13 years 8 months ago
The Google Similarity Distance
Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of `society' is...
Rudi Cilibrasi, Paul M. B. Vitányi
BMCBI
2007
128views more  BMCBI 2007»
13 years 8 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
POPL
2008
ACM
14 years 8 months ago
Multiparty asynchronous session types
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...
Kohei Honda, Nobuko Yoshida, Marco Carbone