507 search results - page 61 / 102 » Computing Sparse Multiples of Polynomials |
109
Voted
DC
2010
15 years 2 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
127
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
108
click to vote
EUROCRYPT
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
127
Voted
ENGL
2008
15 years 2 months ago
2008
An array antenna system with innovative signal processing can enhance the resolution of a signal direction of arrival (DOA) estimation. Super resolution algorithms take advantage o...
101
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
This paper presents a novel deformable model for accurate delineation of regions of interest in medical images that contain regional inhomogeneities. Such images are common in var...