Sciweavers

1712 search results - page 296 / 343
» A Computational Approach to Binding Theory
Sort
View
MOBIHOC
2009
ACM
16 years 2 months ago
Fault tolerant target tracking in sensor networks
In this paper, we present a Gaussian mixture model based approach to capture the spatial characteristics of any target signal in a sensor network, and further propose a temporally...
Min Ding, Xiuzhen Cheng
INFOCOM
2009
IEEE
15 years 8 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li
ICALP
2005
Springer
15 years 7 months ago
Discrete Random Variables over Domains
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...
Michael W. Mislove
IJCAI
1993
15 years 2 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
CSDA
2006
84views more  CSDA 2006»
15 years 1 months ago
Performing hypothesis tests on the shape of functional data
We explore different approaches for performing hypothesis tests on the shape of a mean function by developing general methodologies both, for the often assumed, i.i.d. error struc...
Gareth M. James, Ashish Sood