4110 search results - page 272 / 822 » Efficient algorithms for the 2-gathering problem |
137
click to vote
COR
2006
15 years 6 months ago
2006
This paper presents an algorithm for generating unconstrained guillotine-cutting patterns for rectangular blanks. A pattern includes at most two sections, each of which consists o...
175
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
157
click to vote
AH
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. With the huge increase in the volume of information available in digital form and the increasing diversity of Web applications, the need for efficient, reliable, informat...
178
click to vote
AAAI
2006
15 years 8 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
202
click to vote
BMEI
2009
IEEE
15 years 7 months ago
2009
IEEE
The Gaussian mixture model is a powerful statistical tool in data modeling and analysis. Generally, the EM algorithm is utilized to learn the parameters of the Gaussian mixture. Ho...