9871 search results - page 181 / 1975 » On the Structure of Low Sets |
184
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
197
click to vote
INFOCOM
2006
IEEE
16 years 15 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
256
click to vote
PAMI
2010
15 years 4 months ago
2010
Abstract— One goal of statistical shape analysis is the discrimination between two populations of objects. In this paper, we present results of discriminant analysis on multi-obj...
175
click to vote
TRS
2008
15 years 6 months ago
2008
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theor...
161
click to vote
MICRO
2009
IEEE
16 years 1 months ago
2009
IEEE
Efficient memory hierarchy design is critical due to the increasing gap between the speed of the processors and the memory. One of the sources of inefficiency in current caches is...