3991 search results - page 551 / 799 » Bounding homogeneous models |
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
134
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
122
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing syste...
130
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
123
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...