2107 search results - page 71 / 422 » Computing Small Search Numbers in Linear Time |
140
click to vote
CHI
1997
ACM
15 years 7 months ago
1997
ACM
To understand how people search for a known target item in an unordered pull-down menu, this research presents cognitive models that vary serial versus parallel processing of menu...
125
click to vote
RECOMB
2006
Springer
16 years 3 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
165
click to vote
MOC
1998
15 years 2 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
136
click to vote
ARTCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper presents a Novel Bidirectional motion estimation technique, which is based on the Particle swarm optimization algorithm. Particle swarm optimization (PSO) is a popula...
131
Voted
WINE
2009
Springer
15 years 7 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...