Sciweavers

534 search results - page 42 / 107
» Efficient polynomial L-approximations
Sort
View
TOG
2008
92views more  TOG 2008»
13 years 7 months ago
Optimizing cubature for efficient integration of subspace deformations
We propose an efficient scheme for evaluating nonlinear subspace forces (and Jacobians) associated with subspace deformations. The core problem we address is efficient integration...
Steven S. An, Theodore Kim, Doug L. James
BMCBI
2007
107views more  BMCBI 2007»
13 years 8 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
NIPS
2001
13 years 9 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
ECCC
2010
98views more  ECCC 2010»
13 years 5 months ago
Efficient Semantic Communication via Compatible Beliefs
In previous works, Juba and Sudan [6] and Goldreich, Juba and Sudan [4] considered the idea of "semantic communication", wherein two players, a user and a server, attemp...
Brendan Juba, Madhu Sudan
AMAI
2008
Springer
13 years 8 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka