721 search results - page 124 / 145 » Almost universal graphs |
CACM
1998
13 years 9 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
VIS
2009
IEEE
14 years 11 months ago
2009
IEEE
concept form search query vision confirm consensus refine search query graphics VIE-designer image objects image objects Visual Sign (VIE) run search query words images Iconizer:...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
DCC
2008
IEEE
14 years 9 months ago
2008
IEEE
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...
WALCOM
2010
IEEE
14 years 4 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...