8298 search results - page 105 / 1660 » On the Complexity of Numerical Analysis |
143
click to vote
AMC
2008
15 years 6 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
131
click to vote
AAECC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
165
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
For categorical data there does not exist any similarity measure which is as straight forward and general as the numerical distance between numerical items. Due to this it is ofte...
150
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...
193
click to vote
COMPUTING
2010
15 years 3 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....