Sciweavers

680 search results - page 44 / 136
» Complexity of Strict Implication
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
Martin Grohe, Christoph Koch, Nicole Schweikardt
COCO
2003
Springer
85views Algorithms» more  COCO 2003»
14 years 28 days ago
Universal Languages and the Power of Diagonalization
We define and study strong diagonalization and compare it to weak diagonalization, implicit in [7]. Kozen’s result in [7] shows that virtually every separation can be recast as...
Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel
DBPL
2003
Springer
130views Database» more  DBPL 2003»
14 years 28 days ago
Attribute Grammars for Scalable Query Processing on XML Streams
We introduce the new notion of XML Stream Attribute Grammars (XSAGs). XSAGs are the first scalable query language for XML streams (running strictly in linear time with bounded mem...
Christoph Koch, Stefanie Scherzinger
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 23 days ago
Simplifying XML schema: single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Fran...
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
14 years 12 days ago
Solving large-scale linear circuit problems via convex optimization
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
Javad Lavaei, Aydin Babakhani, Ali Hajimiri, John ...