969 search results - page 161 / 194 » Generalized matching from theory to application |
196
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
246
click to vote
POPL
2001
ACM
16 years 2 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
111
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
119
click to vote
CF
2005
ACM
15 years 3 months ago
2005
ACM
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
137
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...