231 search results - page 37 / 47 » The Number of Independent Sets in a Regular Graph |
111
click to vote
KDD
2000
ACM
15 years 3 months ago
2000
ACM
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
191
click to vote
SPAA
2012
ACM
13 years 2 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
84
Voted
CAV
1999
Springer
15 years 4 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
115
click to vote
ICDE
1993
IEEE
15 years 3 months ago
1993
IEEE
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...