1068 search results - page 170 / 214 » Extremely randomized trees |
87
Voted
MOR
2010
14 years 11 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
112
Voted
COLING
2010
14 years 7 months ago
2010
We present novel kernels based on structured and unstructured features for reranking the N-best hypotheses of conditional random fields (CRFs) applied to entity extraction. The fo...
105
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
119
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
122
Voted
SIGMOD
2001
ACM
16 years 18 days ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...