Sciweavers

119 search results - page 12 / 24
» Optimal Randomness Extraction from a Diffie-Hellman Element
Sort
View
COGSCI
2010
108views more  COGSCI 2010»
13 years 7 months ago
Do Grammars Minimize Dependency Length?
A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for de...
Daniel Gildea, David Temperley
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
14 years 17 days ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 7 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
CIKM
2008
Springer
13 years 9 months ago
Closing the loop in webpage understanding
The two most important tasks in information extraction from the Web are webpage structure understanding and natural language sentences processing. However, little work has been don...
Chunyu Yang, Yong Cao, Zaiqing Nie, Jie Zhou, Ji-R...
IPPS
2010
IEEE
13 years 5 months ago
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
Zheng Wei, Joseph JáJá