Sciweavers

424 search results - page 28 / 85
» Modelling and Evaluation of CCN-Caching Trees
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Closed-form dual perturb and combine for tree-based models
This paper studies the aggregation of predictions made by tree-based models for several perturbed versions of the attribute vector of a test case. A closed-form approximation of t...
Pierre Geurts, Louis Wehenkel
CIKM
2009
Springer
14 years 3 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
INFOSCALE
2006
ACM
14 years 2 months ago
Scheduling divisible loads in the dynamic heterogeneous grid environment
According to the special features of the dynamic heterogeneous grid environment, a loose-coupled and scalable resource model is described by a hybrid multi-level tree reflecting a...
Tao Zhu, Yongwei Wu, Guangwen Yang
ACL
2010
13 years 6 months ago
Automatic Generation of Story Highlights
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...
Kristian Woodsend, Mirella Lapata
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 9 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou