16666 search results - page 2648 / 3334 » Descriptive and Computational Complexity |
241
Voted
COCO
2011
Springer
14 years 7 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
255
Voted
DSN
2011
IEEE
14 years 7 months ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
218
Voted
DSN
2011
IEEE
14 years 7 months ago
2011
IEEE
—We consider the problem of inferring link loss rates using passive measurements. Prior inference approaches are mainly built on the time correlation nature of packet losses. How...
227
Voted
ICDAR
2011
IEEE
14 years 6 months ago
2011
IEEE
—We present a multiresolution scheme for symbol representation and recognition based on statistical shape features. We define a symbol as a set of shape points, each of which is...
265
Voted
ICDCSW
2011
IEEE
14 years 6 months ago
2011
IEEE
—Developing secure wireless sensor networks (WSNs) is a complex process that involves careful design of attack test cases and security countermeasures, as well as meaningful eval...