Sciweavers

2109 search results - page 407 / 422
» Solving Necklace Constraint Problems
Sort
View
105
Voted
NIPS
1998
15 years 1 months ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch
103
Voted
COLING
1996
15 years 1 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
159
Voted
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 1 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
PR
2006
164views more  PR 2006»
15 years 16 days ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung
TELSYS
2008
85views more  TELSYS 2008»
15 years 15 days ago
Trustworthy Web services provisioning for differentiated customer services
With the number of e-Business applications dramatically increasing, a service level agreement (SLA) will play an important part in Web services. The SLA is a combination of severa...
Kaiqi Xiong, Harry G. Perros