1999 search results - page 155 / 400 » Dependently Typed Grammars |
167
click to vote
ICSE
2005
IEEE-ACM
16 years 6 months ago
2005
IEEE-ACM
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
168
click to vote
AAAI
2010
15 years 7 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
160
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
172
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
We had introduced the massively parallel global cellular automata (GCA) model. Parallel algorithms derived from applications can be mapped straight forward onto this model. In thi...
181
click to vote
GLOBECOM
2007
IEEE
16 years 22 days ago
2007
IEEE
— In this paper, we study the asymptotic behavior of the bit–error probability (BEP) and symbol–error probability (SEP) of differential M–ary phase–shift keying with diff...