2226 search results - page 169 / 446 » Computable Analysis via Representations |
186
click to vote
JGO
2010
15 years 1 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
240
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
179
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Latent Layout Analysis (LLA) is a novel unsupervised learning technique to discover objects in unseen images using a set of un-annotated training images. LLA defines a generative ...
157
click to vote
DAC
1991
ACM
15 years 10 months ago
1991
ACM
REX is a program that extracts parasitic resistance and capacitance values for nodes in VLSI layouts. REX also performs network serial and parallel simplifications. Two types of n...
169
click to vote
ECCV
2010
Springer
16 years 2 hour ago
2010
Springer
Abstract. We study the problem of multimodal dimensionality reduction assuming that data samples can be missing at training time, and not all data modalities may be present at appl...