Sciweavers

7106 search results - page 357 / 1422
» Restricted Complexity, General Complexity
Sort
View
JAC
2008
15 years 6 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
PODS
2006
ACM
98views Database» more  PODS 2006»
16 years 5 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch
SIGECOM
2003
ACM
92views ECommerce» more  SIGECOM 2003»
15 years 10 months ago
Multi-attribute exchange market: representation and indexing of orders
We present an automated exchange for trading complex goods, such as used cars, which allows traders to describe desirable purchases and sales by multiple attributes. The developed...
Eugene Fink, Josh Johnson, John Hershberger 0002
123
Voted
COLING
1994
15 years 6 months ago
Towards a Proper Linguistic and Computational Treatment of Scrambling: An Analysis of Japanese
t This paper describes how recent linguistic results in explaining Japanese short and long distance scram hling (:an be directly incorporated into an existing principles-and-parame...
Sandiway Pong
ALT
2006
Springer
16 years 2 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen