Sciweavers

1722 search results - page 200 / 345
» On the sample mean of graphs
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Compressed learning of high-dimensional sparse functions
This paper presents a simple randomised algorithm for recovering high-dimensional sparse functions, i.e. functions f : [0, 1]d → R which depend effectively only on k out of d va...
Karin Schnass, Jan Vybíral
GANDC
2011
93views more  GANDC 2011»
14 years 6 months ago
Bayesian spatial modeling and interpolation using copulas
Copulas have attracted much attention in spatial statistics over the past few years. They are used as a flexible alternative to traditional methods for nonGaussian spatial modelin...
Hannes Kazianka, Jürgen Pilz
SEMWEB
2007
Springer
16 years 19 days ago
OLA in the OAEI 2007 Evaluation Contest
Abstract. Similarity has become a classical tool for ontology confrontation motivated by alignment, mapping or merging purposes. In the definition of an ontologybased measure one ...
Jean François Djoufak Kengue, Jér&oc...
AH
2004
Springer
15 years 12 months ago
Using SiteRank for Decentralized Computation of Web Document Ranking
Abstract. The PageRank algorithm demonstrates the significance of the computation of document ranking of general importance or authority in Web information retrieval. However, doi...
Jie Wu, Karl Aberer
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 11 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman