Sciweavers

2957 search results - page 475 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
PODS
2004
ACM
98views Database» more  PODS 2004»
14 years 8 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 8 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 5 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 4 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
ICCAD
2003
IEEE
123views Hardware» more  ICCAD 2003»
14 years 4 months ago
A Hybrid Approach to Nonlinear Macromodel Generation for Time-Varying Analog Circuits
Modeling frequency-dependent nonlinear characteristics of complex analog blocks and subsystems is critical for enabling efficient verification of mixed-signal system designs. Rece...
Peng Li, Xin Li, Yang Xu, Lawrence T. Pileggi