773 search results - page 121 / 155 » Traversing the Machining Graph |
PLDI
2011
ACM
14 years 15 days ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
77
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Feature selection aims to reduce dimensionality for building comprehensible learning models with good generalization performance. Feature selection algorithms are largely studied ...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...