Computer Science
61 – 70 of 183
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2007
-
Mark
Approximation Algorithms for Geometric Networks
2007)(
- Thesis › Doctoral thesis (monograph)
-
Mark
Approximating the maximum independent set and minimum vertex coloring on box graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Knowledge-based reconfiguration of automation systems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximate distance oracles for graphs with dense clusters
(
- Contribution to journal › Article
-
Mark
On exact complexity of subgraph homeomorphism
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Reporting leadership patterns among trajectories
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Learning to evaluate conditional partial plans
2007) Sixth International Conference on Machine Learning and Applications, 2007. ICMLA 2007. p.235-240(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Finding a heaviest triangle is not harder than matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article
-
Mark
Knowledge Representation for Learning How to Evaluate Partial Plans
2007) The 24th Annual Workshop of the Swedish Artificial Intelligence Society, SAIS 2007(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding