Sciweavers

2969 search results - page 210 / 594
» A space efficient algorithm for group structure computation
Sort
View
129
Voted
IPMI
2005
Springer
16 years 4 months ago
Surface Matching via Currents
Abstract. We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3-dimensional space. Our main contribution is in buildin...
Marc Vaillant, Joan Glaunes
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
16 years 5 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
JMLR
2010
136views more  JMLR 2010»
14 years 10 months ago
Approximate Riemannian Conjugate Gradient Learning for Fixed-Form Variational Bayes
Variational Bayesian (VB) methods are typically only applied to models in the conjugate-exponential family using the variational Bayesian expectation maximisation (VB EM) algorith...
Antti Honkela, Tapani Raiko, Mikael Kuusela, Matti...
134
Voted
ISVD
2007
IEEE
15 years 10 months ago
Two-dimensional line space Voronoi Diagram
Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...
Stéphane Rivière, Dominique Schmitt
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 7 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun