837 search results - page 30 / 168 » Hard combinators |
KDD
2001
ACM
15 years 10 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
84
Voted
EUROPAR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. With the prevalence of multi-core processors and cloud computing, the server consolidation using virtualization has increasingly expanded its territory, and the degree of...
CONSTRAINTS
2008
14 years 10 months ago
2008
We present the Auckland Layout Model (ALM), a constraint-based technique for specifying 2D layout as it is used for arranging the controls in a GUI. Most GUI frameworks offer layo...
91
Voted
ICCV
2009
IEEE
16 years 3 months ago
2009
IEEE
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...