Sciweavers

507 search results - page 74 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 7 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
SPAA
2006
ACM
14 years 1 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
IEEECGIV
2009
IEEE
14 years 2 months ago
Monomial Forms for Curves in CAGD with their Applications
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
Chanon Aphirukmatakun, Natasha Dejdumrong
ICPR
2008
IEEE
14 years 9 months ago
Phase based level set segmentation of blood vessels
The segmentation and analysis of blood vessels has received much attention in the research community. The results aid numerous applications for diagnosis and treatment of vascular...
Gunnar Läthén, Jimmy Jonasson, Magnus ...
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
13 years 11 months ago
Parametric model order reduction accelerated by subspace recycling
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
Lihong Feng, Peter Benner, Jan G. Korvink