1332 search results - page 40 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
JACM
2000
13 years 8 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
AAAI
2008
13 years 10 months ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
ICAI
2009
13 years 6 months ago
2009
- 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...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
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...
DAC
2011
ACM
12 years 8 months ago
2011
ACM
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...