2576 search results - page 134 / 516 » The Complexity of Zero Knowledge |
143
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
131
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
142
click to vote
SIGGRAPH
2000
ACM
15 years 8 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
187
Voted
TIP
2008
15 years 4 months ago
2008
Abstract--Hyperspectral images present some specific characteristics that should be used by an efficient compression system. In compression, wavelets have shown a good adaptability...
109
click to vote
MICS
2007
15 years 4 months ago
2007
The pseudozero set of a system P of polynomials in n variables is the subset of Cn consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable...