29908 search results - page 384 / 5982 » On the Complexity of |
168
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
By using Semi-Definite Programming (SDP) as a tool, a new deign for Two-Dimensional (2-D) Diamond-Shaped (DS) filters is developed. Surprisingly, the diamond shape of the filter is...
205
click to vote
COMPUTING
2010
15 years 4 months ago
2010
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
158
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
231
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—With the rise of XML as a standard for representing business data, XML data warehousing appears as a suitable solution for decision-support applications. In this context, it is ...
216
click to vote
DCG
2011
15 years 1 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...