Sciweavers

218 search results - page 26 / 44
» Probabilistic shadow information spaces
Sort
View
108
Voted
ADHOCNOW
2004
Springer
15 years 3 months ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
IPM
2007
105views more  IPM 2007»
14 years 9 months ago
Parsimonious translation models for information retrieval
In the KL divergence framework, the extended language modeling approach has a critical problem estimating a query model, which is the probabilistic model that encodes user’s inf...
Seung-Hoon Na, In-Su Kang, Jong-Hyeok Lee
ECCC
2006
120views more  ECCC 2006»
14 years 9 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
CHI
2011
ACM
14 years 1 months ago
AnglePose: robust, precise capacitive touch tracking via 3d orientation estimation
We present a finger-tracking system for touch-based interaction which can track 3D finger angle in addition to position, using low-resolution conventional capacitive sensors, th...
Simon Rogers, John Williamson, Craig Stewart, Rode...
NPAR
2004
ACM
15 years 3 months ago
Hardware-determined feature edges
Algorithms that detect silhouettes, creases, and other edge based features often perform per-edge and per-face mesh computations using global adjacency information. These are unsu...
Morgan McGuire, John F. Hughes