Sciweavers

4112 search results - page 349 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ISSAC
2009
Springer
167views Mathematics» more  ISSAC 2009»
16 years 1 months ago
High order derivatives and decomposition of multivariate polynomials
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
Jean-Charles Faugère, Ludovic Perret
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
15 years 8 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
NIPS
2004
15 years 8 months ago
Sampling Methods for Unsupervised Learning
We present an algorithm to overcome the local maxima problem in estimating the parameters of mixture models. It combines existing approaches from both EM and a robust fitting algo...
Robert Fergus, Andrew Zisserman, Pietro Perona
CAD
2006
Springer
15 years 7 months ago
Geometric constraints within feature hierarchies
We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the featu...
Meera Sitharam, Jianjun Oung, Yong Zhou, Adam Arbr...
KAIS
2008
99views more  KAIS 2008»
15 years 6 months ago
Privacy-preserving SVM classification
Classical data mining algorithms implicitly assume complete access to all data, either in centralized or federated form. However, privacy and security concerns often prevent sharin...
Jaideep Vaidya, Hwanjo Yu, Xiaoqian Jiang