Sciweavers

12 search results - page 2 / 3
» Optimal feature weighting for the discrete HMM
Sort
View
CVPR
2010
IEEE
14 years 10 months ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...
ICASSP
2011
IEEE
14 years 1 months ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...
BMCBI
2010
178views more  BMCBI 2010»
14 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...
COMPGEOM
2003
ACM
15 years 3 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk
TROB
2002
138views more  TROB 2002»
14 years 9 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...