Sciweavers

16430 search results - page 63 / 3286
» On Computable Tree Functions
Sort
View
103
Voted
ACL
1998
15 years 3 months ago
A Probabilistic Corpus-Driven Model for Lexical-Functional Analysis
Wc develop a l)ata-Oricntcd Parsing (DOP) model based on the syntactic representations of Lexicalf;unctional Grammar (LFG). We start by summarizing the original DOP model for tree...
Rens Bod, Ronald M. Kaplan
132
Voted
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
15 years 6 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
AHSWN
2008
92views more  AHSWN 2008»
15 years 2 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
148
Voted
SIGIR
2011
ACM
14 years 5 months ago
Functional matrix factorizations for cold-start recommendation
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Ke Zhou, Shuang-Hong Yang, Hongyuan Zha
DM
1998
91views more  DM 1998»
15 years 2 months ago
On some relations between 2-trees and tree metrics
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...
Bruno Leclerc, Vladimir Makarenkov