8780 search results - page 106 / 1756 » On the Feasibility of Consistent Computations |
206
Voted
IJSNET
2007
15 years 6 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
195
Voted
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
171
click to vote
EWSN
2009
Springer
16 years 1 months ago
2009
Springer
Ensuring that every sensor node has the same code version is challenging in dynamic, unreliable multi-hop sensor networks. When nodes have different code versions, the network may...
180
click to vote
CP
1999
Springer
15 years 11 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
217
Voted
VMV
2001
15 years 8 months ago
2001
The handling of situations where multiple visual information occurs requires the fusion of visual information. This is a very common task found in the processing of multisource / ...