Sciweavers

5244 search results - page 600 / 1049
» Structural Complexity of AvgBPP
Sort
View
JAIR
1998
120views more  JAIR 1998»
15 years 6 months ago
The Automatic Inference of State Invariants in TIM
As planning is applied to larger and richer domains the e ort involved in constructing domain descriptions increases and becomes a signi cant burden on the human application desig...
Maria Fox, Derek Long
CORR
1999
Springer
118views Education» more  CORR 1999»
15 years 6 months ago
Supervised Grammar Induction Using Training Data with Limited Constituent Information
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is...
Rebecca Hwa
DAM
1999
128views more  DAM 1999»
15 years 6 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
MISQ
2002
111views more  MISQ 2002»
15 years 6 months ago
A Design Theory for Systems That Support Emergent Knowledge Processes
This paper addresses the design problem of providing IT support for emerging knowledge processes (EKPs). EKPs are organizational activity patterns that exhibit three characteristi...
M. Lynne Markus, Ann Majchrzak, Les Gasser
ML
2002
ACM
178views Machine Learning» more  ML 2002»
15 years 6 months ago
Metric-Based Methods for Adaptive Model Selection and Regularization
We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea ...
Dale Schuurmans, Finnegan Southey