2983 search results - page 209 / 597 » The group marriage problem |
150
click to vote
CP
2007
Springer
16 years 26 days ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
166
Voted
DCOSS
2007
Springer
16 years 26 days ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
133
click to vote
CVPR
2010
IEEE
16 years 10 days ago
2010
IEEE
A novel method for line matching is proposed. The basic idea is to use tentative point correspondences, which can be easily obtained by keypoint matching methods, to significantly...
168
click to vote
IPCCC
2005
IEEE
16 years 8 days ago
2005
IEEE
Due to the dynamic nature of WAHN communications and the multi-node involvement in most WAHN applications, group key management has been proposed for efficient support of secure c...
170
click to vote
SSD
2005
Springer
16 years 5 days ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...