Sciweavers

337 search results - page 42 / 68
» Efficient algorithms for ranking with SVMs
Sort
View
ICIP
2009
IEEE
15 years 3 months ago
Selecting representative and distinctive descriptors for efficient landmark recognition
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
Sheng Gao, Joo-Hwee Lim
DA
2010
123views more  DA 2010»
15 years 2 months ago
Paradoxes in Learning and the Marginal Value of Information
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
Peter Frazier, Warren B. Powell
GECCO
2004
Springer
160views Optimization» more  GECCO 2004»
15 years 11 months ago
Finding Effective Software Metrics to Classify Maintainability Using a Parallel Genetic Algorithm
The ability to predict the quality of a software object can be viewed as a classification problem, where software metrics are the features and expert quality rankings the class lab...
Rodrigo A. Vivanco, Nicolino J. Pizzi
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
16 years 6 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou
ICPR
2004
IEEE
16 years 7 months ago
Perceptual Grouping for Contour Extraction
This paper describes an algorithm that efficiently groups line segments into perceptually salient contours in complex images. A measure of affinity between pairs of lines is used ...
Francisco J. Estrada, Allan D. Jepson