Sciweavers

30 search results - page 2 / 6
» Two Techniques for Minimizing Resolution Proofs
Sort
View
AML
2011
204views Mathematics» more  AML 2011»
13 years 6 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
COMPGEOM
2003
ACM
14 years 4 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...
CHI
2005
ACM
14 years 11 months ago
AppLens and launchTile: two designs for one-handed thumb use on small devices
We present two interfaces to support one-handed thumb use for PDAs and cell phones. Both use Scalable User Interface (ScUI) techniques to support multiple devices with different r...
Amy K. Karlson, Benjamin B. Bederson, John SanGiov...
ACSAC
2003
IEEE
14 years 4 months ago
S-ARP: a Secure Address Resolution Protocol
Tapping into the communication between two hosts on a LAN has become quite simple thanks to tools that can be downloaded from the Internet. Such tools use the Address Resolution P...
Danilo Bruschi, A. Ornaghi, Emilia Rosti
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 11 months ago
Verified Real Number Calculations: A Library for Interval Arithmetic
—Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a...
Marc Daumas, David Lester, César Muñ...