121 search results - page 2 / 25 » Improving branch-and-cut performance by random sampling |
CLEF
2010
Springer
13 years 6 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
IJCV
2006
13 years 6 months ago
2006
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...
SIGMOD
2007
ACM
14 years 6 months ago
2007
ACM
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
A new segmented compressed sampling (CS) method for analog-to-information conversion (AIC) is proposed. An analog signal measured by a number of parallel branches of mixers and int...
HICSS
2006
IEEE
14 years 2 days ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...