4860 search results - page 378 / 972 » SNPs Problems, Complexity, and Algorithms |
146
Voted
CIKM
1998
Springer
15 years 7 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
117
Voted
AIPS
2009
15 years 4 months ago
2009
Distributed POMDPs provide an expressive framework for modeling multiagent collaboration problems, but NEXPComplete complexity hinders their scalability and application in real-wo...
137
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
138
Voted
IPL
2002
15 years 3 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
121
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The problem of estimation of the slowly-varying instantaneous frequency of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved ...