3247 search results - page 335 / 650 » Randomized smoothing networks |
189
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper proposes a unified framework for spatiotemporal segmentation of video sequences. A Bayesian network is presented to model the interactions among the motion vector field...
187
click to vote
EUROCAST
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
164
click to vote
NICSO
2010
Springer
16 years 1 months ago
2010
Springer
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
179
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper we create a framework to model and characterize the impact of time-varying fading communication links on the performance of a mobile sensor network. We propose co...
231
click to vote
TAINN
2005
Springer
16 years 6 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...