Sciweavers

1387 search results - page 216 / 278
» Convexity in Discrete Space
Sort
View
VG
2003
13 years 10 months ago
Hybrid Forward Resampling and Volume Rendering
The transforming and rendering of discrete objects, such as traditional images (with or without depths) and volumes, can be considered as resampling problem – objects are recons...
Xiaoru Yuan, Minh X. Nguyen, Hui Xu, Baoquan Chen
BMCBI
2010
178views more  BMCBI 2010»
13 years 9 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
COMGEO
2010
ACM
13 years 9 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
PAMI
2010
203views more  PAMI 2010»
13 years 7 months ago
Visual Word Ambiguity
— This paper studies automatic image classification by modeling soft-assignment in the popular codebook model. The codebook model describes an image as a bag of discrete visual ...
Jan van Gemert, Cor J. Veenman, Arnold W. M. Smeul...
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 3 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels