1169 search results - page 132 / 234 » Degrees of monotone complexity |
106
Voted
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
ICISC
2004
15 years 2 months ago
2004
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
94
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper we present a method for learning a curve model for detection and segmentation by closely integrating a hierarchical curve representation using generative and discrim...
98
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper, we propose a novel approach to model shape variations. It encodes sparsity, exploits geometric redundancy, and accounts for the different degrees of local variation...
121
Voted
EDBT
2004
ACM
16 years 27 days ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...