Sciweavers

2192 search results - page 100 / 439
» Algorithms for Challenging Motif Problems
Sort
View
NIPS
2004
13 years 9 months ago
Sampling Methods for Unsupervised Learning
We present an algorithm to overcome the local maxima problem in estimating the parameters of mixture models. It combines existing approaches from both EM and a robust fitting algo...
Robert Fergus, Andrew Zisserman, Pietro Perona
CAD
2006
Springer
13 years 8 months ago
Geometric constraints within feature hierarchies
We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the featu...
Meera Sitharam, Jianjun Oung, Yong Zhou, Adam Arbr...
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 8 months ago
Efficient Matrix Completion with Gaussian Models
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...
Flavien Léger, Guoshen Yu, Guillermo Sapiro
AI
2009
Springer
14 years 2 months ago
STFLS: A Heuristic Method for Static and Transportation Facility Location Allocation in Large Spatial Datasets
Abstract. This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located ...
Wei Gu, Xin Wang, Liqiang Geng
WEBI
2009
Springer
14 years 2 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova