2489 search results - page 191 / 498 » On the Subgroup Distance Problem |
150
click to vote
ICPADS
2006
IEEE
15 years 10 months ago
2006
IEEE
In wireless sensor networks (WSNs), a good sensor deployment method is vital to the quality of service (QoS) provided by WSNs. This QoS depends on the coverage of the monitoring a...
103
click to vote
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
118
click to vote
WACV
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper we describe a novel method for gait based identity verification based on Bayesian classification. The verification task is reduced to a two class problem (Client or ...
143
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
130
click to vote
IWDW
2005
Springer
15 years 10 months ago
2005
Springer
In a fingerprinting scheme a distributor places marks in each copy of a digital object. Placing different marks in different copies, uniquely identifies the recipient of each cop...