635 search results - page 17 / 127 » Some Computational Problems Related to Pseudo-intents |
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
ISSAC
1994
Springer
15 years 1 months ago
1994
Springer
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
77
Voted
CONCUR
2004
Springer
15 years 1 months ago
2004
Springer
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
106
click to vote
CMG
2008
14 years 11 months ago
2008
One of the challenges in building analytic performance models such as queuing network models is obtaining service demands for the various workloads and various devices. While some...
PODS
2004
ACM
15 years 9 months ago
2004
ACM
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...