Sciweavers

1095 search results - page 117 / 219
» Preprocessing of Intractable Problems
Sort
View
CVPR
2011
IEEE
13 years 8 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes
VLSID
2009
IEEE
177views VLSI» more  VLSID 2009»
14 years 11 months ago
Accelerating System-Level Design Tasks Using Commodity Graphics Hardware: A Case Study
Many system-level design tasks (e.g. timing analysis, hardware/software partitioning and design space exploration) involve computational kernels that are intractable (usually NP-ha...
Unmesh D. Bordoloi, Samarjit Chakraborty
FOCS
2007
IEEE
14 years 4 months ago
Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
Sudipto Guha, Kamesh Munagala
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
14 years 2 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
AAAI
2010
13 years 11 months ago
The Model-Based Approach to Autonomous Behavior: A Personal View
The selection of the action to do next is one of the central problems faced by autonomous agents. In AI, three approaches have been used to address this problem: the programming-b...
Hector Geffner