Sciweavers

10819 search results - page 76 / 2164
» Addition and multiplication of sets
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 7 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
PIMRC
2010
IEEE
13 years 5 months ago
Joint channel assignment and link scheduling for wireless mesh networks: Revisiting the Partially Overlapped Channels
Despite all the encouraging reports on the benefit of Partially Overlapped Channels (POCs), the relative simple interference models and rather arbitrary network settings considered...
Xiang Liu, Jun Luo
AML
2008
85views more  AML 2008»
13 years 8 months ago
A hierarchy of hereditarily finite sets
This article defines a hierarchy on the hereditarily finite sets which reflects the way sets are built up from the empty set by repeated adjunction, the addition to an already exis...
Laurence Kirby
APAL
2010
71views more  APAL 2010»
13 years 8 months ago
On some definable sets over fields with analytic structure
We discover geometric properties of certain definable sets over non-Archimedean valued fields with analytic structures. Results include a parameterized smooth stratification theore...
Y. Firat Çelikler
ECCV
1992
Springer
13 years 12 months ago
Critical Sets for 3D Reconstruction Using Lines
This paper describes the geometrical limitations of algorithms for 3D reconstruction which use corresponding line tokens. In addition to announcing a description of the general cri...
Thomas Buchanan