Sciweavers

1000 search results - page 153 / 200
» Dependency Tree Automata
Sort
View
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
14 years 5 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
ECML
2007
Springer
14 years 5 months ago
Structure Learning of Probabilistic Relational Models from Incomplete Relational Data
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
Xiao-Lin Li, Zhi-Hua Zhou
LACL
2005
Springer
14 years 4 months ago
Linguistic Facts as Predicates over Ranges of the Sentence
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
Benoît Sagot
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 4 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
ANTSW
2004
Springer
14 years 4 months ago
How to Use Ants for Hierarchical Clustering
Abstract. We present in this paper, a new model for document hierarchical clustering, which is inspired from the self-assembly behavior of real ants. We have simulated the way ants...
Hanene Azzag, Christiane Guinot, Gilles Venturini