2924 search results - page 409 / 585 » Lower Bounds in Distributed Computing |
163
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Object segmentation needs to be driven by top-down knowledge to produce semantically meaningful results. In this paper, we propose a supervised segmentation approach that tightly ...
156
click to vote
OPODIS
2010
15 years 2 months ago
2010
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
198
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
133
click to vote
CSFW
2007
IEEE
15 years 11 months ago
2007
IEEE
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
151
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...