Sciweavers

1204 search results - page 201 / 241
» Termination of Polynomial Programs
Sort
View
ALT
2004
Springer
14 years 6 months ago
On Kernels, Margins, and Low-Dimensional Mappings
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
Maria-Florina Balcan, Avrim Blum, Santosh Vempala
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
WINE
2005
Springer
100views Economy» more  WINE 2005»
14 years 3 months ago
A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Va...
GISCIENCE
2004
Springer
130views GIS» more  GISCIENCE 2004»
14 years 3 months ago
Comparing Exact and Approximate Spatial Auto-regression Model Solutions for Spatial Data Analysis
The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions f...
Baris M. Kazar, Shashi Shekhar, David J. Lilja, Ra...
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård