100 search results - page 7 / 20 » Solving the simple continuous table layout problem |
100
click to vote
CDVE
2004
Springer
15 years 5 months ago
2004
Springer
Creativity has become a valuable asset, given the fast paced changes most companies must nowadays deal with. Companies now look for creative, highly adaptive individuals who can ex...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
TKDE
2008
14 years 11 months ago
2008
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
78
Voted
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
In many multi agent learning problems, it is difficult to determine, a priori, the agent reward structure that will lead to good performance. This problem is particularly pronoun...
AAAI
2010
15 years 1 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...