Sciweavers

3136 search results - page 300 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
JMLR
2012
13 years 9 months ago
UPAL: Unbiased Pool Based Active Learning
In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by minimizing the unbiased estimator of the risk of a hypothe...
Ravi Ganti, Alexander Gray
CVPR
2012
IEEE
13 years 9 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...
ACL
2012
13 years 9 months ago
Labeling Documents with Timestamps: Learning from their Time Expressions
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
Nathanael Chambers
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
15 years 10 months ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
VLDB
1999
ACM
188views Database» more  VLDB 1999»
15 years 11 months ago
Comparing Hierarchical Data in External Memory
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
Sudarshan S. Chawathe