Sciweavers

1435 search results - page 215 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
JACM
2007
132views more  JACM 2007»
14 years 9 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
LREC
2010
152views Education» more  LREC 2010»
14 years 11 months ago
Grammar Extraction from Treebanks for Hindi and Telugu
Grammars play an important role in many Natural Language Processing (NLP) applications. The traditional approach to creating grammars manually, besides being labor-intensive, has ...
Prasanth Kolachina, Sudheer Kolachina, Anil Kumar ...
MLG
2007
Springer
15 years 4 months ago
Abductive Stochastic Logic Programs for Metabolic Network Inhibition Learning
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, Jose Santos
ML
2008
ACM
150views Machine Learning» more  ML 2008»
14 years 9 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
IPSN
2009
Springer
15 years 4 months ago
Application-informed radio duty-cycling in a re-taskable multi-user sensing system
As sensor networks mature, there will be an increasing need for re-usable, dynamically taskable software systems that support multiple concurrent applications. In this paper, we c...
Omprakash Gnawali, Jongkeun Na, Ramesh Govindan