Sciweavers

461 search results - page 51 / 93
» Practical polynomial factoring in polynomial time
Sort
View
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
15 years 11 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
PODS
2004
ACM
86views Database» more  PODS 2004»
15 years 9 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven
GLOBECOM
2008
IEEE
15 years 4 months ago
Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
ICC
2007
IEEE
15 years 4 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
ESOP
2007
Springer
15 years 3 months ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter