Sciweavers

503 search results - page 26 / 101
» Equality In Lazy Computation Systems
Sort
View
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
14 years 11 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng
WSC
2004
13 years 11 months ago
Simulation of Coherent Risk Measures
In financial risk management, a coherent risk measure equals the maximum expected loss under several different probability measures, which are analogous to systems in ranking and ...
Vadim Lesnevski, Barry L. Nelson, Jeremy Staum
ISTCS
1993
Springer
14 years 1 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
ICDCS
1996
IEEE
14 years 1 months ago
The Relative Importance of Concurrent Writers and Weak Consistency Models
This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based ...
Peter J. Keleher
DLT
2008
13 years 11 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...