1405 search results - page 247 / 281 » We Are No Longer A Priesthood |
110
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
103
click to vote
SIGECOM
2011
ACM
14 years 10 days ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
111
click to vote
HIPEAC
2011
Springer
13 years 9 months ago
2011
Springer
Dynamic typing is a barrier for JavaScript applications to achieve high performance. Compared with statically typed languages, the major overhead of dynamic typing comes from runt...
POPL
2012
ACM
13 years 5 months ago
2012
ACM
Data races are among the most reliable indicators of programming errors in concurrent software. For at least two decades, Lamport’s happens-before (HB) relation has served as th...