Sciweavers

440 search results - page 38 / 88
» Multiple Comparisons in Induction Algorithms
Sort
View
ICML
2004
IEEE
16 years 19 days ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 6 days ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
SIGCSE
2006
ACM
188views Education» more  SIGCSE 2006»
15 years 5 months ago
A data mining course for computer science: primary sources and implementations
An undergraduate elective course in data mining provides a strong opportunity for students to learn research skills, practice data structures, and enhance their understanding of a...
David R. Musicant
ICNP
2006
IEEE
15 years 5 months ago
Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast
— The rising popularity of live IPTV has triggered renewed interest in P2P multicast. In particular, the simple and robust ‘swarming’ style of P2P multicast is currently favo...
Vidhyashankar Venkataraman, Kaouru Yoshida, Paul F...
PODS
2002
ACM
164views Database» more  PODS 2002»
15 years 12 months ago
Characterizing Memory Requirements for Queries over Continuous Data Streams
We consider conjunctive queries with arithmetic comparisons over multiple continuous data streams. We specify an algorithm for determining whether or not a query can be evaluated ...
Arvind Arasu, Brian Babcock, Shivnath Babu, Jon Mc...