467 search results - page 33 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
STOC
2010
ACM
15 years 9 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
106
click to vote
FCS
2006
15 years 1 months ago
2006
Secret sharing schemes are methods for distributing a secret among n participants in such a way that any qualified subsets of participants can recover the secret, and unqualified ...
MOR
2002
14 years 11 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
104
Voted
ICIP
2002
IEEE
16 years 1 months ago
2002
IEEE
The goal in image segmentation is to label pixels in an image based on the properties of each pixel and its surrounding region. Recently Content-Based Image Retrieval (CBIR) has e...