4328 search results - page 139 / 866 » A New Kind of Science |
158
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
We carefully investigate humanity’s intuitive understanding of trust and extract from it fundamental properties that succinctly synthesize how trust works. From this detailed ch...
128
Voted
FOCS
2008
IEEE
16 years 22 days ago
2008
IEEE
We prove that any graph G with n points has a distribution T over spanning trees such that for any edge (u, v) the expected stretch ET ∼T [dT (u, v)/dG(u, v)] is bounded by ˜O(...
159
click to vote
FOCS
2006
IEEE
16 years 9 days ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
150
click to vote
FOCS
2005
IEEE
15 years 12 months ago
2005
IEEE
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 â...
140
click to vote
ACMSE
2004
ACM
15 years 11 months ago
2004
ACM
Sensor networks consist of resource-constrained sensors operating in a variety of environments. Given the severe constraints on these sensors, it is a particularly challenging pro...