Sciweavers

1041 search results - page 108 / 209
» Randomizing Reductions of Search Problems
Sort
View
ECCV
2002
Springer
14 years 9 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
WWW
2008
ACM
14 years 8 months ago
Using the wisdom of the crowds for keyword generation
In the sponsored search model, search engines are paid by businesses that are interested in displaying ads for their site alongside the search results. Businesses bid for keywords...
Ariel Fuxman, Panayiotis Tsaparas, Kannan Achan, R...
CVPR
2009
IEEE
15 years 2 months ago
Reducing JointBoost-Based Multiclass Classification to Proximity Search
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
Alexandra Stefan (University of Texas at Arlington...
WWW
2006
ACM
14 years 8 months ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das
IJON
2010
199views more  IJON 2010»
13 years 5 months ago
DFS-generated pathways in GA crossover for protein structure prediction
Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a ...
Tamjidul Hoque, Madhu Chetty, Andrew Lewis, Abdul ...