Sciweavers

1257 search results - page 70 / 252
» A generalization of Euler's constant
Sort
View
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 10 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
ATAL
2010
Springer
13 years 10 months ago
Laplacian-based consensus on spatial computers
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
Nelson Elhage, Jacob Beal
SIGSOFT
2010
ACM
13 years 6 months ago
Creating and evolving developer documentation: understanding the decisions of open source contributors
Developer documentation helps developers learn frameworks and libraries. To better understand how documentation in open source projects is created and maintained, we performed a q...
Barthélémy Dagenais, Martin P. Robil...
WWW
2011
ACM
13 years 3 months ago
Exploiting session-like behaviors in tag prediction
In social bookmarking systems, existing methods in tag prediction have shown that the performance of prediction can be significantly improved by modeling users’ preferences. Ho...
Dawei Yin, Liangjie Hong, Brian D. Davison
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 9 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...