Sciweavers

467 search results - page 23 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
ICASSP
2011
IEEE
14 years 3 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
FOCS
1998
IEEE
15 years 4 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
CPHYSICS
2006
103views more  CPHYSICS 2006»
14 years 11 months ago
A band factorization technique for transition matrix element asymptotics
A new method of evaluating transition matrix elements between wave functions associated with orthogonal polynomials is proposed. The technique relies on purely algebraic manipulat...
Emmanuel Perrey-Debain, I. David Abrahams
176
Voted
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
16 years 1 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
ICC
2007
IEEE
15 years 6 months ago
PERD: Polynomial-based Event Region Detection in Wireless Sensor Networks
We propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function ...
Torsha Banerjee, Demin Wang, Bin Xie, Dharma P. Ag...