19 search results - page 3 / 4 » Obtaining Optimal k-Cardinality Trees Fast |
120
click to vote
EGH
2010
Springer
14 years 9 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
100
click to vote
EUROCAST
2009
Springer
15 years 6 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
111
Voted
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Horizontal gene transfer (HGT) plays a major role in microbial genome diversiļ¬cation, and is claimed to be rampant among various groups of genes in bacteria. Further, HGT is a ma...
126
Voted
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
CADE
2008
Springer
15 years 12 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...