Sciweavers

5169 search results - page 59 / 1034
» Locality approximation using time
Sort
View
ANTSW
2010
Springer
15 years 11 days ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
CIKM
2006
Springer
15 years 6 months ago
Structure-based querying of proteins using wavelets
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we...
Keith Marsolo, Srinivasan Parthasarathy, Kotagiri ...
NA
2008
92views more  NA 2008»
15 years 2 months ago
Computing bivariate splines in scattered data fitting and the finite-element method
A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves sol...
Larry L. Schumaker
128
Voted
CVPR
2009
IEEE
16 years 9 months ago
Observe Locally, Infer Globally: a Space-Time MRF for Detecting Abnormal Activities with Incremental Updates
We propose a space-time Markov Random Field (MRF) model to detect abnormal activities in video. The nodes in the MRF graph correspond to a grid of local regions in the video fra...
Jaechul Kim (University of Texas at Austin), Krist...
ML
2012
ACM
385views Machine Learning» more  ML 2012»
13 years 10 months ago
An alternative view of variational Bayes and asymptotic approximations of free energy
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
Kazuho Watanabe