2226 search results - page 105 / 446 » Computable Analysis via Representations |
132
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Cooperative co-evolution is often used to solve difficult optimization problems by means of problem decomposition. Its performance for such tasks can vary widely from good to disa...
157
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
124
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
139
click to vote
MM
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
140
click to vote
SAS
1999
Springer
15 years 8 months ago
1999
Springer
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...