Sciweavers

499 search results - page 49 / 100
» Constructive Induction by Analogy
Sort
View
ICC
2009
IEEE
165views Communications» more  ICC 2009»
13 years 5 months ago
Coding-Aware Scheduling for Reliable Many-to-One Flows
We revisit the problem of scheduling the sources transmissions in a many-to-one flow to provide reliable communication between n sources and a single destination. The performance o...
Osameh M. Al-Kofahi, Ahmed E. Kamal
POPL
2008
ACM
14 years 8 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
14 years 2 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
PAKDD
2001
ACM
157views Data Mining» more  PAKDD 2001»
14 years 4 days ago
Applying Pattern Mining to Web Information Extraction
Information extraction (IE) from semi-structured Web documents is a critical issue for information integration systems on the Internet. Previous work in wrapper induction aim to so...
Chia-Hui Chang, Shao-Chen Lui, Yen-Chin Wu
AAAI
2008
13 years 10 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl