Sciweavers

59 search results - page 8 / 12
» A Natural Counting of Lambda Terms
Sort
View
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 7 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
JCT
2011
66views more  JCT 2011»
13 years 4 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
POPL
2009
ACM
14 years 4 months ago
Declarative aspects of memory management in the concurrent collections parallel programming model
Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level comput...
Zoran Budimlic, Aparna Chandramowlishwaran, Kathle...
KDD
2012
ACM
190views Data Mining» more  KDD 2012»
12 years 7 days ago
Multi-label hypothesis reuse
Multi-label learning arises in many real-world tasks where an object is naturally associated with multiple concepts. It is well-accepted that, in order to achieve a good performan...
Sheng-Jun Huang, Yang Yu, Zhi-Hua Zhou
WWW
2009
ACM
14 years 10 months ago
Competitive analysis from click-through log
Existing keyword suggestion tools from various search engine companies could automatically suggest keywords related to the advertisers' products or services, counting in simp...
Gang Wang, Jian Hu, Yunzhang Zhu, Hua Li, Zheng Ch...