2996 search results - page 493 / 600 » Numberings and Randomness |
168
click to vote
NETWORKS
2010
15 years 4 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
166
click to vote
PAMI
2010
15 years 4 months ago
2010
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
172
click to vote
PVLDB
2010
15 years 4 months ago
2010
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
176
click to vote
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
We study the emergence of cooperation in dynamic, anonymous social networks, such as in online communities. We examine prisoner’s dilemma played under a social matching protocol...
173
click to vote
TCOM
2010
15 years 4 months ago
2010
In wireless multi-hop packet radio networks (MPRNs) that employ geographic transmissions, sleep schedules or node activation techniques may be used to power off some nodes to cons...