Sciweavers

3991 search results - page 140 / 799
» Bounding homogeneous models
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 8 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
14 years 1 months ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
DAC
2000
ACM
14 years 14 days ago
An asymptotically constant, linearly bounded methodology for the statistical simulation of analog circuits including component m
Abstract: This paper presents a new statistical methodology to simulate the effect of both inter-die and intra-die variation on the electrical performance of analog integrated circ...
Carlo Guardiani, Sharad Saxena, Patrick McNamara, ...
ESA
2006
Springer
108views Algorithms» more  ESA 2006»
13 years 11 months ago
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
Matthias Englert, Matthias Westermann
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen