1940 search results - page 291 / 388 » The Dynamic Logic of Permission |
109
click to vote
STOC
2007
ACM
16 years 6 days ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
104
click to vote
STOC
2006
ACM
16 years 6 days ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
190
click to vote
SIGMOD
2009
ACM
16 years 3 days ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
197
click to vote
SIGMOD
2008
ACM
16 years 1 days ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
171
click to vote
SIGMOD
2008
ACM
16 years 1 days ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...