Sciweavers

3049 search results - page 173 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
TNN
1998
132views more  TNN 1998»
15 years 6 months ago
Synthesis of fault-tolerant feedforward neural networks using minimax optimization
—In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated w...
Dipti Deodhare, M. Vidyasagar, S. Sathiya Keerthi
GECCO
2006
Springer
142views Optimization» more  GECCO 2006»
15 years 10 months ago
An evolutionary approach to camera-based projector calibration
In this paper, we describe a GA to solve for the orientation and lens characteristics of a projector, given images of a dome screen illuminated by the projector. We use synthetic ...
Clayton Matthew Johnson, Anu Bhat, William C. Thib...
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 6 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
DAC
2005
ACM
15 years 8 months ago
Template-driven parasitic-aware optimization of analog integrated circuit layouts
Layout parasitics have great impact on analog circuit performance. This paper presents an algorithm for explicit parasitic control during layout retargeting of analog integrated c...
Sambuddha Bhattacharya, Nuttorn Jangkrajarng, C.-J...
FOCS
1990
IEEE
15 years 10 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski