34170 search results - page 6726 / 6834 » Optimization |
137
click to vote
SIAMCOMP
2002
15 years 2 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
152
click to vote
SIAMJO
2002
15 years 2 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
159
click to vote
TIP
1998
15 years 2 months ago
1998
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
142
click to vote
SIGKDD
2002
15 years 2 months ago
2002
In database marketing, data mining has been used extensively to find the optimal customer targets so as to maximize return on investment. In particular, using marketing campaign d...
137
click to vote
TNN
1998
15 years 2 months ago
1998
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...