Sciweavers

706 search results - page 124 / 142
» Super Solutions in Constraint Programming
Sort
View
112
Voted
ICML
2009
IEEE
16 years 15 days ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 2 days ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
CADE
2006
Springer
16 years 21 min ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
ICCAD
2004
IEEE
155views Hardware» more  ICCAD 2004»
15 years 8 months ago
Robust analog/RF circuit design with projection-based posynomial modeling
In this paper we propose a RObust Analog Design tool (ROAD) for post-tuning analog/RF circuits. Starting from an initial design derived from hand analysis or analog circuit synthe...
Xin Li, Padmini Gopalakrishnan, Yang Xu, Lawrence ...
CVPR
2010
IEEE
15 years 8 months ago
Asymmetric Region-to-Image Matching for Comparing Images with Generic Object Categories
We present a feature matching algorithm that leverages bottom-up segmentation. Unlike conventional image-toimage or region-to-region matching algorithms, our method finds corresp...
Jaechul Kim, Kristen Grauman