Sciweavers

126 search results - page 4 / 26
» Finding minimal bases in arbitrary spline spaces
Sort
View
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
14 years 11 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
BMCBI
2004
151views more  BMCBI 2004»
14 years 9 months ago
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Jens Reeder, Robert Giegerich
77
Voted
ICLP
1999
Springer
15 years 1 months ago
Finding Fair Allocations for the Coalition Problem with Constraints
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
Evan Tick, Roland H. C. Yap, Michael J. Maher
AAAI
1997
14 years 11 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
SIAMIS
2010
152views more  SIAMIS 2010»
14 years 4 months ago
Nonparametric Regression between General Riemannian Manifolds
We study nonparametric regression between Riemannian manifolds based on regularized empirical risk minimization. Regularization functionals for mappings between manifolds should re...
Florian Steinke, Matthias Hein, Bernhard Schö...