1960 search results - page 46 / 392 » The Logic of Large Enough |
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
ICS
2001
Tsinghua U.
14 years 5 days ago
2001
Tsinghua U.
A large logical register file is important to allow effective compiler transformations or to provide a windowed space of registers to allow fast function calls. Unfortunately, a l...
POLICY
2007
Springer
14 years 1 months ago
2007
Springer
—There is increasing demand for running interacting applications in a secure and controllable way on mobile devices. Such demand is not fully supported by the Java/.NET security ...
DATE
1998
IEEE
13 years 12 months ago
1998
IEEE
Functional scan chains are scan chains that have scan paths through a circuit's functional logic and flip-flops. Establishing functional scan paths by test point insertion (T...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Reasoning about perception of depth and about spatial relations between moving physical objects is a challenging problem. We investigate the representation of depth and motion by m...