Sciweavers

732 search results - page 134 / 147
» What Is It Like to Be a Rat
Sort
View
DLS
2005
176views Languages» more  DLS 2005»
13 years 10 months ago
Dynamic data polyvariance using source-tagged classes
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
S. Alexander Spoon, Olin Shivers
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
AAAI
2010
13 years 9 months ago
Collaborative Filtering Meets Mobile Recommendation: A User-Centered Approach
With the increasing popularity of location tracking services such as GPS, more and more mobile data are being accumulated. Based on such data, a potentially useful service is to m...
Vincent Wenchen Zheng, Bin Cao, Yu Zheng, Xing Xie...
AWPN
2008
311views Algorithms» more  AWPN 2008»
13 years 9 months ago
WoPeD 2.0 goes BPEL 2.0
WoPeD (Workflow Petrinet Designer) is an easy-to-use, Java-based open source software tool being developed at the University of Cooperative Education, Karlsruhe. WoPeD is able to e...
Andreas Eckleder, Thomas Freytag
DAGSTUHL
2007
13 years 9 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau