1999 search results - page 199 / 400 » Finding Reductions Automatically |
113
click to vote
AAAI
2010
15 years 3 months ago
2010
On the surface, bidirectional search (BDS) is an attractive idea with the potential for significant asymptotic reductions in search effort. However, the results in practice often ...
135
Voted
DMIN
2007
15 years 3 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
LREC
2010
15 years 3 months ago
2010
In this paper, we investigate the acoustic properties of phonemes in three speaking styles: read speech, prepared speech and spontaneous speech. Our aim is to better understand wh...
109
click to vote
IADIS
2008
15 years 3 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
107
click to vote
IJCAI
2007
15 years 3 months ago
2007
This paper addresses the problem of concept sampling. In many real-world applications, a large collection of mixed concepts is available for decision making. However, the collecti...