Sciweavers

8695 search results - page 252 / 1739
» Making the Complex Simple
Sort
View
IJCAI
2003
15 years 8 months ago
Causal Theories of Action: A Computational Core
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regressio...
Jérôme Lang, Fangzhen Lin, Pierre Mar...
NAACL
2003
15 years 8 months ago
Unsupervised Learning of Morphology for English and Inuktitut
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...
Howard Johnson, Joel D. Martin
153
Voted
DAM
2008
61views more  DAM 2008»
15 years 6 months ago
Scheduling malleable tasks with interdependent processing rates: Comments and observations
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...
Edmund K. Burke, Moshe Dror, James B. Orlin
VLDB
2002
ACM
161views Database» more  VLDB 2002»
15 years 6 months ago
BANKS: Browsing and Keyword Searching in Relational Databases
The BANKS system enables keyword-based search on databases, together with data and schema browsing. BANKS enables users to extract information in a simple manner without any knowl...
B. Aditya, Gaurav Bhalotia, Soumen Chakrabarti, Ar...
ICASSP
2011
IEEE
14 years 10 months ago
Least squares approximation and polyphase decomposition for pipelining recursive filters
Current techniques used in pipelining recursive filters require significant hardware complexity. These techniques attempt to preserve the exact frequency response of the origina...
Aditya Gupta, Andrew C. Singer, Naresh R. Shanbhag