8512 search results - page 1551 / 1703 » Computing Theory With Relevance |
192
click to vote
CIE
2007
Springer
16 years 19 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
167
click to vote
CMSB
2007
Springer
16 years 19 days ago
2007
Springer
We explore some presynaptic mechanisms of the calyx of Held synapse through a stochastic model. The model, drawn from a kinetic approach developed in literature, exploits process c...
199
click to vote
IPSN
2007
Springer
16 years 18 days ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
213
click to vote
IPSN
2007
Springer
16 years 18 days ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
180
click to vote
ISVC
2007
Springer
16 years 18 days ago
2007
Springer
Optical motion capture can be classified as an inference problem: given the data produced by a set of cameras, the aim is to extract the hidden state, which in this case encodes t...