Sciweavers

3838 search results - page 581 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
122
Voted
FLAIRS
2009
15 years 1 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
153
Voted
ECCV
2010
Springer
15 years 29 days ago
Modeling the Temporal Extent of Actions
In this paper, we present a framework for estimating what portions of videos are most discriminative for the task of action recognition. We explore the impact of the temporal cropp...
Scott Satkin, Martial Hebert
138
Voted
PROCEDIA
2010
103views more  PROCEDIA 2010»
14 years 10 months ago
Towards generating optimised finite element solvers for GPUs from high-level specifications
We argue that producing maintainable high-performance implementations of finite element methods for multiple targets requires that they are written using a high-level domain-speci...
Graham R. Markall, David A. Ham, Paul H. J. Kelly
120
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Wavelet footprints for detection and sorting of extracellular neural action potentials
Spike detection and sorting is a fundamental step in the analysis of extracellular neural recording. Here, we propose a combined spike detection-feature extraction algorithm that ...
Ki Yong Kwon, Karim G. Oweiss
139
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Multi-graph regularization for efficient delivery of user generated content in online social networks
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
Jacob Chakareski