1006 search results - page 181 / 202 » What is this page known for |
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
SIGMETRICS
2009
ACM
14 years 3 months ago
2009
ACM
Errors in dynamic random access memory (DRAM) are a common form of hardware failure in modern compute clusters. Failures are costly both in terms of hardware replacement costs and...
ICRA
2008
IEEE
14 years 3 months ago
2008
IEEE
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
SIPS
2008
IEEE
14 years 3 months ago
2008
IEEE
Low-density parity-check (LDPC) codes on par with convolutional turbo codes (CTC) are two of the most powerful error correction codes known to perform very close to the Shannon li...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...