4698 search results - page 215 / 940 » Making Functionality More General |
147
Voted
EMNLP
2011
14 years 3 months ago
2011
We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...
112
Voted
IPL
2008
15 years 3 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
236
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
111
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
115
click to vote
PODC
2004
ACM
15 years 9 months ago
2004
ACM
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...