Sciweavers

348 search results - page 16 / 70
» Event tree based sampling
Sort
View
ECML
2003
Springer
15 years 3 months ago
Learning Context Free Grammars in the Limit Aided by the Sample Distribution
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Yoav Seginer
CORR
2010
Springer
174views Education» more  CORR 2010»
14 years 10 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
PADS
1999
ACM
15 years 2 months ago
Scheduling Critical Channels in Conservative Parallel Discrete Event Simulation
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general cons...
Xiao Zhonge, Brian Unger, Rob Simmonds, John G. Cl...
AHS
2006
IEEE
86views Hardware» more  AHS 2006»
15 years 4 months ago
An Efficient Technique for Preventing Single Event Disruptions in Synchronous and Reconfigurable Architectures
This paper presents a unique SEU (single Event Upset) mitigation technique based upon Temporal Data Sampling for synchronous circuits and configuration bit storage for programmabl...
Sajid Baloch, Tughrul Arslan, Adrian Stoica
PODS
2007
ACM
196views Database» more  PODS 2007»
15 years 10 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul