3954 search results - page 126 / 791 » Image-based Model Completion |
167
Voted
JCO
2007
15 years 5 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
112
Voted
IJBC
2002
15 years 4 months ago
2002
In the architecture of cellular neural networks (CNN), connections among cells are built on linear coupling laws. These laws are characterized by the so-called templates which exp...
119
click to vote
IANDC
2010
15 years 3 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
133
click to vote
WSC
2004
15 years 6 months ago
2004
The following paper briefly presents the formulation and development of a case study supply chain simulation model as developed for an industrial company. The case study company i...
198
click to vote
SDM
2012
SIAM
13 years 7 months ago
2012
SIAM
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...