Sciweavers

7057 search results - page 1377 / 1412
» Tasks, domains, and languages
Sort
View
COLING
1996
13 years 10 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
CIDR
2009
181views Algorithms» more  CIDR 2009»
13 years 10 months ago
The Case for RodentStore: An Adaptive, Declarative Storage System
Recent excitement in the database community surrounding new applications--analytic, scientific, graph, geospatial, etc.--has led to an explosion in research on database storage sy...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
AI
2008
Springer
13 years 9 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
AI
2007
Springer
13 years 9 months ago
Learning, detection and representation of multi-agent events in videos
In this paper, we model multi-agent events in terms of a temporally varying sequence of sub-events, and propose a novel approach for learning, detecting and representing events in...
Asaad Hakeem, Mubarak Shah
BMCBI
2008
151views more  BMCBI 2008»
13 years 9 months ago
CMKb: a web-based prototype for integrating Australian Aboriginal customary medicinal plant knowledge
Background: The customary medicinal plant knowledge possessed by the Australian Aboriginal people is a significant resource. Published information on it is scattered throughout th...
Jitendra Gaikwad, Varun Khanna, Subramanyam Vemulp...
« Prev « First page 1377 / 1412 Last » Next »