7773 search results - page 1299 / 1555 » On generalized Frame-Stewart numbers |
177
click to vote
SEC
2008
15 years 8 months ago
2008
Many applications inherently disclose information because perfect privacy protection is prohibitively expensive. RFID tags, for example, cannot be equipped with the cryptographic p...
164
click to vote
SIROCCO
2008
15 years 8 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
167
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
160
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
159
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...