Sciweavers

1397 search results - page 162 / 280
» On the Need for Practical Formal Methods
Sort
View
CIE
2010
Springer
15 years 8 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
SIGCSE
2008
ACM
171views Education» more  SIGCSE 2008»
15 years 4 months ago
Contributing student pedagogy
A Contributing Student Pedagogy (CSP) is a pedagogy that encourages students to contribute to the learning of others and to value the contributions of others. CSP in formal educat...
John Hamer, Quintin I. Cutts, Jana Jacková,...
CIKM
2009
Springer
15 years 11 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
PSIVT
2007
Springer
129views Multimedia» more  PSIVT 2007»
15 years 10 months ago
Multi-target Tracking with Poisson Processes Observations
This paper considers the problem of Bayesian inference in dynamical models with time-varying dimension. These models have been studied in the context of multiple target tracking pr...
Sergio Hernández, Paul Teal
ICPR
2006
IEEE
16 years 5 months ago
Configuring Mixed Reality Environment
We present a practical framework for registering a Mixed Reality(MR) environment of an arbitrary number of agents. Each agent consist of a head mounted display (HMD), which consis...
Imran N. Junejo, Xiaochun Cao, Hassan Foroosh