1554 search results - page 249 / 311 » Parameterized Complexity and Approximation Algorithms |
141
Voted
ECML
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
144
click to vote
JAIR
2008
15 years 2 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
114
Voted
MONET
2006
15 years 2 months ago
2006
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
260
Voted
ECCC
2011
14 years 9 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
116
click to vote
ICPR
2004
IEEE
16 years 3 months ago
2004
IEEE
In this paper, we address the use of three dimensional facial shape information for human face identification. We propose a new method to represent faces as 3D registered point cl...