Sciweavers

580 search results - page 65 / 116
» An Efficient Implementation of an Active Set Method for SVMs
Sort
View
AAAI
2010
13 years 10 months ago
Trial-Based Dynamic Programming for Multi-Agent Planning
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
IJON
2006
189views more  IJON 2006»
13 years 9 months ago
Storing and restoring visual input with collaborative rank coding and associative memory
Associative memory in cortical circuits has been held as a major mechanism for content-addressable memory. Hebbian synapses implement associative memory efficiently when storing s...
Martin Rehn, Friedrich T. Sommer
ML
2010
ACM
193views Machine Learning» more  ML 2010»
13 years 3 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
CMSB
2008
Springer
13 years 10 months ago
Automatic Complexity Analysis and Model Reduction of Nonlinear Biochemical Systems
Kinetic models for biochemical systems often comprise a large amount of coupled differential equations with species concentrations varying on different time scales. In this paper w...
Dirk Lebiedz, Dominik Skanda, Marc Fein
ECCV
2008
Springer
14 years 11 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar