3267 search results - page 429 / 654 » Generalized quasirandom graphs |
148
click to vote
EKAW
2000
Springer
15 years 10 months ago
2000
Springer
The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of mos...
154
click to vote
KBS
2007
15 years 6 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
188
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
173
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Wikipedia is the largest monolithic repository of human knowledge. In addition to its sheer size, it represents a new encyclopedic paradigm by interconnecting articles through hyp...
167
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...