688 search results - page 27 / 138 » General Partitioning on Random Graphs |
111
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
105
Voted
CORR
2004
Springer
15 years 7 days ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
113
click to vote
SIAMJO
2008
15 years 9 days ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
131
Voted
ICIP
2004
IEEE
16 years 2 months ago
2004
IEEE
This paper describes a computational model for deriving a decomposition of objects from laser rangefinder data. The process aims to produce a set of parts defined by compactness a...
112
click to vote
WG
2005
Springer
15 years 5 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...