Sciweavers

4415 search results - page 669 / 883
» How to Pair with a Human
Sort
View
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
13 years 10 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
NETWORK
2007
167views more  NETWORK 2007»
13 years 9 months ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao
PAMI
2007
219views more  PAMI 2007»
13 years 9 months ago
Shape Estimation Using Polarization and Shading from Two Views
—This paper presents a novel method for 3D surface reconstruction that uses polarization and shading information from two views. The method relies on the polarization data acquir...
Gary Atkinson, Edwin R. Hancock
PR
2007
141views more  PR 2007»
13 years 9 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock
SIAMSC
2010
116views more  SIAMSC 2010»
13 years 8 months ago
Recursively Accelerated Multilevel Aggregation for Markov Chains
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
Hans De Sterck, K. Miller, G. Sanders, M. Winlaw