115 search results - page 8 / 23 » The Complexity of List Ranking of Trees |
CC
2010
Springer
14 years 7 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
DAM
2008
14 years 10 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
A crucial element in consumer electronic commerce is a catalog tool that not only finds the product for the user, but also convinces him that he has made the best choice. To do th...
EDBT
2002
ACM
15 years 10 months ago
2002
ACM
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
NIPS
2007
14 years 11 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...