Sciweavers

9 search results - page 2 / 2
» G-Optimal Design with Laplacian Regularization
Sort
View
CIKM
2010
Springer
13 years 2 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
MM
2009
ACM
187views Multimedia» more  MM 2009»
13 years 9 months ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...
ICASSP
2011
IEEE
12 years 8 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
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...
Jacob Chakareski
SMA
2003
ACM
173views Solid Modeling» more  SMA 2003»
13 years 10 months ago
Automating the CAD/CAE dimensional reduction process
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
Krishnan Suresh