Sciweavers

61 search results - page 12 / 13
» On Linear Secret Sharing for Connectivity in Directed Graphs
Sort
View
ICMI
2003
Springer
111views Biometrics» more  ICMI 2003»
14 years 16 days ago
Distributed and local sensing techniques for face-to-face collaboration
This paper describes techniques that allow users to collaborate on tablet computers that employ distributed sensing techniques to establish a privileged connection between devices...
Ken Hinckley
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 7 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 8 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 5 months ago
Gaussian Process Structural Equation Models with Latent Variables
In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by...
Ricardo Silva
NHM
2010
87views more  NHM 2010»
13 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...