Sciweavers

1027 search results - page 76 / 206
» Progress on the Progressive Party Problem
Sort
View
ECAI
2010
Springer
15 years 5 months ago
Open-ended Grounded Semantics
Artificial agents trying to achieve communicative goals in situated interactions in the real-world need powerful computational systems for conceptualizing their environment. In ord...
Michael Spranger, Martin Loetzsch, Simon Pauw
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 4 months ago
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Gábor Ivanyos, Marek Karpinski, Lajos R&oac...
CPHYSICS
2007
103views more  CPHYSICS 2007»
15 years 4 months ago
Algorithms for the evolution of electronic properties in nanocrystals
We illustrate recent progress in developing algorithms for solving the Kohn-Sham problem. Key ingredients of our algorithm include pseudopotentials implemented on a real space gri...
James R. Chelikowsky, Murilo L. Tiago, Yousef Saad...
JMLR
2006
89views more  JMLR 2006»
15 years 4 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
MP
2006
88views more  MP 2006»
15 years 3 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis