Sciweavers

8695 search results - page 124 / 1739
» Making the Complex Simple
Sort
View
ENTCS
2008
91views more  ENTCS 2008»
13 years 9 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
ECCC
2002
103views more  ECCC 2002»
13 years 9 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
IWPEC
2010
Springer
13 years 7 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
ICIP
1998
IEEE
14 years 11 months ago
A Neural Network Approach for Reconstructing Surface Shape from Shading
In this work, a framework for the reconstruction of smooth surface shapes from shading images is presented. The method is based on using a backpropagationbased neural network for ...
Jezekiel Ben-Arie, Dibyendu Nandy