Sciweavers

33 search results - page 5 / 7
» Simple Models for Scaling in Phylogenetic Trees
Sort
View
COCOON
2006
Springer
14 years 8 days ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
EMNLP
2009
13 years 6 months ago
A Joint Language Model With Fine-grain Syntactic Tags
We present a scalable joint language model designed to utilize fine-grain syntactic tags. We discuss challenges such a design faces and describe our solutions that scale well to l...
Denis Filimonov, Mary P. Harper
JAIR
2011
187views more  JAIR 2011»
13 years 3 months ago
A Monte-Carlo AIXI Approximation
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
Joel Veness, Kee Siong Ng, Marcus Hutter, William ...
IPM
2008
159views more  IPM 2008»
13 years 8 months ago
Exploring syntactic structured features over parse trees for relation extraction using kernel methods
Extracting semantic relationships between entities from text documents is challenging in information extraction and important for deep information processing and management. This ...
Min Zhang, Guodong Zhou, AiTi Aw
DAM
2010
112views more  DAM 2010»
13 years 8 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson