3008 search results - page 455 / 602 » Independence in connected graphs |
162
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...
189
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
188
click to vote
INFOCOM
2005
IEEE
16 years 19 days ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
205
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
195
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...