Sciweavers

507 search results - page 61 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
DC
2010
13 years 7 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
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...
Seth Pettie
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
11 years 10 months ago
Global minimum cuts in surface embedded graphs
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,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
EUROCRYPT
1999
Springer
14 years 1 days ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
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 ...
Jan Camenisch, Markus Michels
ENGL
2008
192views more  ENGL 2008»
13 years 7 months ago
Sensitivity Analysis for Direction of Arrival Estimation using a Root-MUSIC Algorithm
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...
Zekeriya Aliyazicioglu, H. K. Hwang, Marshall Gric...
ICPR
2006
IEEE
14 years 8 months ago
Segmentation of Medical Images with Regional Inhomogeneities
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...
Dimitrios E. Maroulis, Dimitrios K. Iakovidis, Mic...