4581 search results - page 847 / 917 » Computing Transformation Semigroups |
SPAA
2009
ACM
16 years 13 days ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
PODC
2009
ACM
16 years 13 days ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
125
click to vote
KDD
2008
ACM
16 years 8 days ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
CHI
2001
ACM
16 years 7 days ago
2001
ACM
CARD (Collaborative Analysis of Requirements and Design) is an influential technique for participatory design and participatory analysis that is in use on three continents. This p...
208
click to vote
POPL
2008
ACM
16 years 6 days ago
2008
ACM
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...