Sciweavers

761 search results - page 23 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
ICAI
2009
13 years 5 months ago
On the Construction of Initial Basis Function for Efficient Value Function Approximation
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...
Chung-Cheng Chiu, Kuan-Ta Chen
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 7 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
DAC
2011
ACM
12 years 7 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
ICML
2010
IEEE
13 years 8 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...