Sciweavers

7930 search results - page 1211 / 1586
» Greedy in Approximation Algorithms
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
A Square-Root Sampling Approach to Fast Histogram-Based Search
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...
Huang-Wei Chang, Hwann-Tzong Chen
SAC
2009
ACM
16 years 1 months ago
A gradient oriented recombination scheme for evolution strategies
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
Haifeng Chen, Guofei Jiang
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
16 years 1 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
FPGA
2009
ACM
154views FPGA» more  FPGA 2009»
16 years 1 months ago
Synthesis of reconfigurable high-performance multicore systems
Reconfigurable high-performance computing systems (RHPC) have been attracting more and more attention over the past few years. RHPC systems are a promising solution for accelerati...
Jason Cong, Karthik Gururaj, Guoling Han
ICFCA
2009
Springer
16 years 1 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
« Prev « First page 1211 / 1586 Last » Next »