121 search results - page 17 / 25 » Improving branch-and-cut performance by random sampling |
ICALP
2010
Springer
15 years 17 days ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
ICCV
2005
IEEE
16 years 14 days ago
2005
IEEE
Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
When building a classifier from clean training data for a particular test environment, knowledge about the environmental noise and channel should be taken into account. We propos...
JMLR
2010
14 years 5 months ago
2010
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
PODS
2006
ACM
15 years 10 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...