116 search results - page 21 / 24 » A New Intersection Model and Improved Algorithms for Toleran... |
122
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
134
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
129
Voted
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
162
Voted
CVPR
2010
IEEE
16 years 1 days ago
2010
IEEE
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
140
Voted
CC
2009
Springer
15 years 8 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...