2487 search results - page 118 / 498 » Partitions of Graphs into Trees |
COMBINATORICS
2002
14 years 10 months ago
2002
If G = Kn is the complete graph, the classical Pr
101
click to vote
DASFAA
2004
IEEE
15 years 1 months ago
2004
IEEE
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
EGH
2009
Springer
14 years 7 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
100
click to vote
PE
2011
Springer
14 years 5 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...