Sciweavers

360 search results - page 21 / 72
» Explanations and Proof Trees
Sort
View
AI
2006
Springer
13 years 10 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
RSA
2011
106views more  RSA 2011»
13 years 23 days ago
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Luc Devroye, Svante Janson
TCAD
2002
128views more  TCAD 2002»
13 years 9 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
VLDB
2007
ACM
161views Database» more  VLDB 2007»
14 years 10 months ago
Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
Feifei Li, Ke Yi, Marios Hadjieleftheriou, George ...
AAAI
2007
14 years 7 days ago
Mining Sequential Patterns and Tree Patterns to Detect Erroneous Sentences
An important application area of detecting erroneous sentences is to provide feedback for writers of English as a Second Language. This problem is difficult since both erroneous ...
Guihua Sun, Gao Cong, Xiaohua Liu, Chin-Yew Lin, M...