Sciweavers

2430 search results - page 414 / 486
» Computing Tutte Polynomials
Sort
View
TSP
2008
109views more  TSP 2008»
15 years 2 months ago
Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
110
Voted
JSCIC
2007
89views more  JSCIC 2007»
15 years 2 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa
118
Voted
VC
2008
126views more  VC 2008»
15 years 2 months ago
Efficient reconstruction from non-uniform point sets
Abstract We propose a method for non-uniform reconstruction of 3D scalar data. Typically, radial basis functions, trigonometric polynomials or shift-invariant functions are used in...
Erald Vuçini, Torsten Möller, M. Eduar...
139
Voted
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
15 years 2 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
123
Voted
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 2 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...