Sciweavers

3116 search results - page 110 / 624
» Positively dependent types
Sort
View
STOC
2001
ACM
140views Algorithms» more  STOC 2001»
16 years 4 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 4 months ago
Crowdsourcing, Attention and Productivity
We show through an analysis of a massive data set from YouTube that the productivity exhibited in crowdsourcing exhibits a strong positive dependence on attention, measured by the...
Bernardo A. Huberman, Daniel M. Romero, Fang Wu
ICASSP
2011
IEEE
14 years 8 months ago
Single target tracking using vector magnetometers
With the electromagnetic theory as basis, we present a sensor model for three-axis magnetometers suitable for localization and tracking applications. The model depends on a physic...
Niklas Wahlstrom, Jonas Callmer, Fredrik Gustafsso...
IPCO
2010
125views Optimization» more  IPCO 2010»
15 years 5 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
EUROSYS
2009
ACM
16 years 1 months ago
Pointless tainting?: evaluating the practicality of pointer tainting
This paper evaluates pointer tainting, an incarnation of Dynamic Information Flow Tracking (DIFT), which has recently become an important technique in system security. Pointer tai...
Asia Slowinska, Herbert Bos