Sciweavers

963 search results - page 32 / 193
» Escape Analysis on Lists
Sort
View
86
Voted
HPCA
2006
IEEE
15 years 10 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
INFOCOM
2008
IEEE
15 years 4 months ago
Dynamic Jamming Mitigation for Wireless Broadcast Networks
—Wireless communications are inherently symmetric; that is, it takes an attacker the same amount of power to modulate a signal as it does for a legitimate node to modulate the sa...
Jerry T. Chiang, Yih-Chun Hu
POPL
2012
ACM
13 years 5 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
COLING
1994
14 years 11 months ago
Adjuncts and the Processing of Lexical Rules
The standard HPSG analysis of Germanic verb clusters can not explain the observed narrowscope readings of adjuncts in such verb clusters. We present an extension of the HPSG analy...
Gertjan van Noord, Gosse Bouma
IPL
2002
125views more  IPL 2002»
14 years 9 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards