Sciweavers

607 search results - page 80 / 122
» Unifying Exact Completions
Sort
View
ICDAR
2009
IEEE
15 years 5 months ago
Unsupervised Selection and Discriminative Estimation of Orthogonal Gaussian Mixture Models for Handwritten Digit Recognition
The problem of determining the appropriate number of components is important in finite mixture modeling for pattern classification. This paper considers the application of an unsu...
Xuefeng Chen, Xiabi Liu, Yunde Jia
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
15 years 5 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
IWCIA
2009
Springer
15 years 5 months ago
Sub-pixel Segmentation with the Image Foresting Transform
The Image Foresting Transform (IFT) is a framework for image partitioning, commonly used for interactive segmentation. Given an image where a subset of the image elements (seed-poi...
Filip Malmberg, Joakim Lindblad, Ingela Nyströ...
SIGECOM
2009
ACM
95views ECommerce» more  SIGECOM 2009»
15 years 5 months ago
Eliciting truthful answers to multiple-choice questions
Motivated by the prevalence of online questionnaires in electronic commerce, and of multiple-choice questions in such questionnaires, we consider the problem of eliciting truthful...
Nicolas S. Lambert, Yoav Shoham
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
15 years 5 months ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough