4066 search results - page 468 / 814 » Almost Complete Sets |
209
click to vote
IEICET
2010
15 years 4 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
248
click to vote
CHB
2011
15 years 2 months ago
2011
In this paper, we explore how privacy settings and privacy policy consumption (reading the privacy policy) affect the relationship between privacy attitudes and disclosure behavio...
188
click to vote
COGSR
2011
15 years 2 months ago
2011
Methods for cleaning up (or recognizing) states of a neural network are crucial for the functioning of many neural cognitive models. For example, Vector Symbolic Architectures pro...
255
click to vote
CVIU
2011
15 years 2 months ago
2011
The medial axis transform is valuable for shape representation as it is complete and captures part structure. However, its exact computation for arbitrary 3D models is not feasibl...
163
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Multi-access networks may exhibit severe unfairness in throughput, in the sense that some nodes receive structurally higher throughput than others. Recent studies show that this u...