1331 search results - page 179 / 267 » Complexity bounds for zero-test algorithms |
180
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
161
click to vote
PKDD
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
187
click to vote
WAW
2007
Springer
16 years 11 days ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
148
click to vote
GLOBECOM
2006
IEEE
16 years 10 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
172
click to vote
SI3D
2006
ACM
16 years 7 days ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...