85 search results - page 7 / 17 » Scaling limit of random k-trees |
158
click to vote
JSAC
2010
15 years 4 months ago
2010
—Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, c...
170
click to vote
KBSE
2008
IEEE
16 years 26 days ago
2008
IEEE
Abstract—A poorly understood but important factor in random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear wheth...
183
click to vote
ISCI
2008
15 years 6 months ago
2008
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
186
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent...
177
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Hierarchical conditional random fields have been successfully applied to object segmentation. One reason is their ability to incorporate contextual information at different scales....