Sciweavers

275 search results - page 15 / 55
» Improved Guarantees for Learning via Similarity Functions
Sort
View
COMBINATORICA
2010
14 years 4 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
COLT
2007
Springer
15 years 3 months ago
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
Peter Auer, Ronald Ortner, Csaba Szepesvári
PAKDD
2009
ACM
134views Data Mining» more  PAKDD 2009»
15 years 7 months ago
On Link Privacy in Randomizing Social Networks.
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
15 years 4 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
BMCBI
2008
124views more  BMCBI 2008»
14 years 9 months ago
A relation based measure of semantic similarity for Gene Ontology annotations
Background: Various measures of semantic similarity of terms in bio-ontologies such as the Gene Ontology (GO) have been used to compare gene products. Such measures of similarity ...
Brendan Sheehan, Aaron J. Quigley, Benoit Gaudin, ...