Sciweavers

3096 search results - page 190 / 620
» The Generalized FITC Approximation
Sort
View
142
Voted
ICALP
2010
Springer
15 years 9 months ago
The Positive Semidefinite Grothendieck Problem with Rank Constraint
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Jop Briët, Fernando Mário de Oliveira ...
149
Voted
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 8 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
ATAL
2010
Springer
15 years 6 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
168
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
101
Voted
CSDA
2008
65views more  CSDA 2008»
15 years 5 months ago
How to compare small multivariate samples using nonparametric tests
In plant pathology, in particular, and plant science, in general, experiments are often conducted to determine disease and related responses of plants to various treatments. Typic...
Arne C. Bathke, Solomon W. Harrar, Laurence V. Mad...