174 search results - page 31 / 35 » Advances in Instance Selection for Instance-Based Learning A... |
PRICAI
2004
Springer
15 years 2 months ago
2004
Springer
When we have a large amount of information, we usually use categories with a hierarchy, in which all information is assigned. This paper proposes a new method of integrating two ca...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
WEBDB
2010
Springer
15 years 2 months ago
2010
Springer
An important requirement for emerging applications which aim to locate and integrate content distributed over the Web is to identify pages that are relevant for a given domain or ...
STOC
2007
ACM
15 years 9 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
PAMI
2010
14 years 7 months ago
2010
—In this paper we present a compositional and dynamic model for face aging. The compositional model represents faces in each age group by a hierarchical And-Or graph, in which An...