Sciweavers

1290 search results - page 117 / 258
» New algorithms of the Q-learning type
Sort
View
POPL
2007
ACM
14 years 9 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
ICFP
2006
ACM
14 years 9 months ago
Extensible programming with first-class cases
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
Matthias Blume, Umut A. Acar, Wonseok Chae
WWW
2009
ACM
14 years 9 months ago
Mining multilingual topics from wikipedia
In this paper, we try to leverage a large-scale and multilingual knowledge base, Wikipedia, to help effectively analyze and organize Web information written in different languages...
Xiaochuan Ni, Jian-Tao Sun, Jian Hu, Zheng Chen
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 2 months ago
Computing Frequent Itemsets Inside Oracle 10G
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...
Wei Li, Ari Mozes
DSOM
2003
Springer
14 years 2 months ago
Towards Peer-to-Peer Traffic Analysis Using Flows
One of the main problems with today's Internet traffic analysis is caused by the large number of network-based applications whose types and traffic patterns are more complicat...
Myung-Sup Kim, Hun-Jeong Kang, James Won-Ki Hong