Sciweavers

1554 search results - page 249 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
ECML
1997
Springer
15 years 4 months ago
Parallel and Distributed Search for Structure in Multivariate Time Series
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 ...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
JAIR
2008
107views more  JAIR 2008»
14 years 12 months ago
Planning with Durative Actions in Stochastic Domains
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...
Mausam, Daniel S. Weld
MONET
2006
107views more  MONET 2006»
14 years 12 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
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...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao
ECCC
2011
205views ECommerce» more  ECCC 2011»
14 years 6 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
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 ...
Fabian Wagner
ICPR
2004
IEEE
16 years 1 months ago
3D Shape-based Face Recognition using Automatically Registered Facial Surfaces
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...
Berk Gökberk, Lale Akarun, M. Okan Irfanoglu