2745 search results - page 512 / 549 » A fast algorithm for computing large Fibonacci numbers |
169
Voted
PAMI
2011
14 years 10 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
201
Voted
MST
2010
14 years 10 months ago
2010
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
160
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
137
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
139
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...