1085 search results - page 63 / 217 » Hug over a distance |
MHCI
2009
Springer
15 years 4 months ago
2009
Springer
This paper illustrates the thesis research and process that led me to conceive, design and evaluate the Phototropic Memories device, a novel interface supporting the intimate shar...
ISMVL
2007
IEEE
15 years 4 months ago
2007
IEEE
Starting from an axiomatization of a generalization of Shannon entropy we introduce a set of axioms for a parametric family of distances over sets of partitions of finite sets. T...
COCO
2001
Springer
15 years 2 months ago
2001
Springer
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
JUCS
2008
14 years 9 months ago
2008
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
102
click to vote
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...