Sciweavers

3281 search results - page 371 / 657
» Bases for parametrized iterativity
Sort
View
SIAMJO
2008
114views more  SIAMJO 2008»
15 years 6 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
TIT
2008
103views more  TIT 2008»
15 years 6 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
JCST
2007
97views more  JCST 2007»
15 years 6 months ago
Improved Collision Attack on Hash Function MD5
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
Jie Liang, Xue-Jia Lai
TWC
2008
105views more  TWC 2008»
15 years 6 months ago
On Multi-User EXIT Chart Analysis Aided Turbo-Detected MBER Beamformer Designs
This paper studies the mutual information transfer characteristics of a novel iterative soft interference cancellation (SIC) aided beamforming receiver communicating over both addi...
Shuang Tan, Sheng Chen, Lajos Hanzo
VC
2008
102views more  VC 2008»
15 years 6 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...