Sciweavers

7821 search results - page 1532 / 1565
» Nested Ordered Sets and their Use for Data Modelling
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 4 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
140
Voted
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 4 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
TIT
2008
105views more  TIT 2008»
14 years 11 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
ICCD
2006
IEEE
86views Hardware» more  ICCD 2006»
15 years 9 months ago
Interconnect Matching Design Rule Inferring and Optimization through Correlation Extraction
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
Rasit Onur Topaloglu, Andrew B. Kahng
100
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
« Prev « First page 1532 / 1565 Last » Next »