Sciweavers

1717 search results - page 59 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
CIVR
2006
Springer
201views Image Analysis» more  CIVR 2006»
15 years 10 months ago
Efficient Margin-Based Rank Learning Algorithms for Information Retrieval
Learning a good ranking function plays a key role for many applications including the task of (multimedia) information retrieval. While there are a few rank learning methods availa...
Rong Yan, Alexander G. Hauptmann
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
15 years 5 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
16 years 6 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...
WADS
2009
Springer
257views Algorithms» more  WADS 2009»
16 years 22 days ago
Rank-Balanced Trees
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 21 days ago
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
Eric Lehman, Rina Panigrahy