2244 search results - page 354 / 449 » A new heuristic approach for non-convex optimization problem... |
200
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
In this paper we propose a new communication synthesis approach targeting systems with sequential communication media (SCM). Since SCMs require that the reading sequence and writi...
151
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
186
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Semi-supervised clustering uses the limited background knowledge to aid unsupervised clustering algorithms. Recently, a kernel method for semi-supervised clustering has been introd...
201
click to vote
DLOG
2007
15 years 8 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an 1-regularized linear regression prob...