Sciweavers

1787 search results - page 138 / 358
» classification 2006
Sort
View
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
15 years 4 months ago
Even Astral Configurations
A configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane so that every point has q straight lines passing through it and every line has k p...
Leah Wrenn Berman
CHI
2006
ACM
16 years 4 months ago
Keepin' it real: pushing the desktop metaphor with physics, piles and the pen
We explore making virtual desktops behave in a more physically realistic manner by adding physics simulation and using piling instead of filing as the fundamental organizational s...
Anand Agarawala, Ravin Balakrishnan
IEPOL
2006
60views more  IEPOL 2006»
15 years 4 months ago
A model of piracy
This paper develops a simple model of software piracy to analyze the short-run effects of piracy on software usage and the long-run effects on development incentives. We consider ...
Sang Hoo Bae, Jay Pil Choi
JSYML
2006
98views more  JSYML 2006»
15 years 4 months ago
On weak and strong interpolation in algebraic logics
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a s...
Saharon Shelah, Gábor Sági
COMBINATORICS
2000
101views more  COMBINATORICS 2000»
15 years 4 months ago
Bound Graph Polysemy
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
Paul J. Tanenbaum