K-tree

Results: 627



#Item
91Kinetic Stable Delaunay Graphs Pankaj K. Agarwal Duke University Haim Kaplan

Kinetic Stable Delaunay Graphs Pankaj K. Agarwal Duke University Haim Kaplan

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2011-05-25 21:15:25
92K:�Documents�ehu�ns�aAttractions.wpd

K:DocumentsehunsaAttractions.wpd

Add to Reading List

Source URL: www.kapehu.com

Language: English - Date: 2015-04-16 15:34:13
93royale projects : contemporary art  “Lucid Stead” Project Statement – Phillip K. Smith, III After the long, dusty, bumpy, anxious trip out into the far edges of Joshua Tree, you open your car door and for the first

royale projects : contemporary art “Lucid Stead” Project Statement – Phillip K. Smith, III After the long, dusty, bumpy, anxious trip out into the far edges of Joshua Tree, you open your car door and for the first

Add to Reading List

Source URL: media.virbcdn.com

Language: English - Date: 2013-11-27 03:39:56
94Annals of Botany 114: 315– 324, 2014 doi:aob/mcu107, available online at www.aob.oxfordjournals.org Relative growth rate variation of evergreen and deciduous savanna tree species is driven by different traits K

Annals of Botany 114: 315– 324, 2014 doi:aob/mcu107, available online at www.aob.oxfordjournals.org Relative growth rate variation of evergreen and deciduous savanna tree species is driven by different traits K

Add to Reading List

Source URL: www.resecol.wur.nl

Language: English - Date: 2014-07-28 09:36:01
95FH13N E B R A S K A F O R E S T S E RV I C E Emerald Ash Borer Treatment Options

FH13N E B R A S K A F O R E S T S E RV I C E Emerald Ash Borer Treatment Options

Add to Reading List

Source URL: nfs.unl.edu

Language: English - Date: 2015-02-20 10:35:37
96Fast Search in Hamming Space with Multi-Index Hashing Mohammad Norouzi Ali Punjani David J. Fleet Department of Computer Science University of Toronto

Fast Search in Hamming Space with Multi-Index Hashing Mohammad Norouzi Ali Punjani David J. Fleet Department of Computer Science University of Toronto

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2012-06-28 15:40:37
97Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge†

Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge†

Add to Reading List

Source URL: www.cs.swarthmore.edu

Language: English - Date: 2003-09-17 11:15:54
98k-Anonymous Decision Tree Induction? Arik Friedman, Assaf Schuster, and Ran Wolff Technion – Israel Institute of Technology Computer Science Dept. {arikf,assaf,ranw}@cs.technion.ac.il

k-Anonymous Decision Tree Induction? Arik Friedman, Assaf Schuster, and Ran Wolff Technion – Israel Institute of Technology Computer Science Dept. {arikf,assaf,ranw}@cs.technion.ac.il

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2006-09-27 11:53:40
    9918   SCIENCE HIGHLIGHTS: Annual recorders of the past The potential of tree rings in Terra Australis Chris Turney1, J. Palmer1, K. Allen2, P. Baker2 and P. Grierson3

    18  SCIENCE HIGHLIGHTS: Annual recorders of the past The potential of tree rings in Terra Australis Chris Turney1, J. Palmer1, K. Allen2, P. Baker2 and P. Grierson3

    Add to Reading List

    Source URL: www.pages-igbp.org

    - Date: 2014-04-03 08:33:23
      100Unavoidable subtrees Maria Axenovich∗ and Georg Osang† July 5, 2012 Abstract Let Tk be a family of all k-vertex trees. For T ⊆ Tk and a tree T , we write T → T if

      Unavoidable subtrees Maria Axenovich∗ and Georg Osang† July 5, 2012 Abstract Let Tk be a family of all k-vertex trees. For T ⊆ Tk and a tree T , we write T → T if

      Add to Reading List

      Source URL: www.math.kit.edu

      Language: English - Date: 2012-09-20 07:53:57