Sciweavers

218 search results - page 30 / 44
» Probabilistic shadow information spaces
Sort
View
CJ
2002
67views more  CJ 2002»
14 years 9 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
84
Voted
ECCV
2008
Springer
15 years 11 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson
EMNLP
2004
14 years 11 months ago
Max-Margin Parsing
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
Ben Taskar, Dan Klein, Mike Collins, Daphne Koller...
63
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 9 months ago
Asymptotic Sum-Capacity of Random Gaussian Interference Networks Using Interference Alignment
We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on ...
Matthew Aldridge, Oliver Johnson, Robert J. Piecho...
AINA
2007
IEEE
15 years 1 months ago
Domain Modelling for Ubiquitous Computing Applications
Many Ubiquitous computing applications can be considered as planning and acting problems in environments characterised by uncertainty and partial observability. Such systems rely ...
Anthony Harrington, Vinny Cahill