Sciweavers

1494 search results - page 29 / 299
» Kernels for Global Constraints
Sort
View
ECML
2006
Springer
13 years 11 months ago
An Adaptive Kernel Method for Semi-supervised Clustering
Semi-supervised clustering uses the limited background knowledge to aid unsupervised clustering algorithms. Recently, a kernel method for semi-supervised clustering has been introd...
Bojun Yan, Carlotta Domeniconi
VLSID
2002
IEEE
120views VLSI» more  VLSID 2002»
14 years 8 months ago
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing
We describe a new algorithm for floorplan evaluation using timing-driven buffered routing according to a prescribed buffer site map. Specifically, we describe a provably good mult...
Christoph Albrecht, Andrew B. Kahng, Ion I. Mandoi...
ICML
2004
IEEE
14 years 1 months ago
Learning a kernel matrix for nonlinear dimensionality reduction
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
Kilian Q. Weinberger, Fei Sha, Lawrence K. Saul
ICTAI
2006
IEEE
14 years 1 months ago
Finding Crucial Subproblems to Focus Global Search
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
Susan L. Epstein, Richard J. Wallace
ICIP
2003
IEEE
14 years 9 months ago
Histogram intersection kernel for image classification
In this paper we address the problem of classifying images, by exploiting global features that describe color and illumination properties, and by using the statistical learning pa...
Annalisa Barla, Francesca Odone, Alessandro Verri