Sciweavers

16666 search results - page 344 / 3334
» Descriptive and Computational Complexity
Sort
View
DEBS
2011
ACM
14 years 10 months ago
DejaVu: a complex event processing system for pattern matching over live and historical data streams
This short paper provides an overview of the DejaVu complex event processing (CEP) system, with an emphasis on its novel architecture and query optimization techniques for correla...
Nihal Dindar, Peter M. Fischer, Nesime Tatbul
IJCAI
1989
15 years 8 months ago
A Problem Space Approach to Expert System Specification
One view of expert system development separates the endeavor into two parts. First, a domain expert, with the aid of a knowledge engineer, articulates a procedure for performing t...
Gregg Yost, Allen Newell
ECCC
2006
107views more  ECCC 2006»
15 years 6 months ago
Energy Complexity and Entropy of Threshold Circuits
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
Wolfgang Maass, Kei Uchizawa, Rodney J. Douglas
CAD
2006
Springer
15 years 6 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Hilbert's Thirteenth Problem and Circuit Complexity
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...
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Br...