Sciweavers

2938 search results - page 26 / 588
» On obfuscating point functions
Sort
View
VC
2008
126views more  VC 2008»
13 years 7 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...
CGI
2009
IEEE
13 years 5 months ago
RBF-based image restoration utilising auxiliary points
Utilisation of Radial Basis Functions (RBF) for reconstruction of damaged images became common technique nowadays. This paper deals with computation and utilisation of auxiliary p...
J. Zapletal, Petr Vanecek, Václav Skala
ANTS
2010
Springer
291views Algorithms» more  ANTS 2010»
13 years 11 months ago
Fixed Points for Discrete Logarithms
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...
Mariana Levin, Carl Pomerance, K. Soundararajan
DM
2010
77views more  DM 2010»
13 years 7 months ago
Hall-Littlewood polynomials and fixed point enumeration
We resolve affirmatively some conjectures of Reiner, Stanton, and White [6] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and co...
Brendon Rhoades
FOCM
2002
97views more  FOCM 2002»
13 years 7 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd