Sciweavers

46 search results - page 2 / 10
» XPath evaluation in linear time with polynomial combined com...
Sort
View
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
14 years 6 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
ENTCS
2008
102views more  ENTCS 2008»
13 years 5 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
13 years 11 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
CORR
2000
Springer
134views Education» more  CORR 2000»
13 years 5 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
DAM
2006
78views more  DAM 2006»
13 years 5 months ago
Hybrid rounding techniques for knapsack problems
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Monaldo Mastrolilli, Marcus Hutter