default search action

combined dblp search
author search
venue search
publication search

ask others

Nathan S. Netanyahu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Amihood Amir

> Home > Persons > Nathan S. Netanyahu

Publications

2004
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/vissym/AmirKKNW04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/vissym/AmirKKNW04
Amihood Amir, Reuven Kashi, Daniel A. Keim, Nathan S. Netanyahu, Markus Wawryniuk:
Shape-Embedded-Histograms for Visual Data Mining. VisSym 2004: 55-64, 341
2003
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/icdm/AmirKN03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdm/AmirKN03
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu:
Efficient Multidimensional Quantitative Hypotheses Generation. ICDM 2003: 3-10
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/icdm/AmirKNKW03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdm/AmirKNKW03
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, Daniel A. Keim, Markus Wawryniuk:
Analyzing High-Dimensional Data by Subspace Validity. ICDM 2003: 473-476
2001
[c11]
- view
  - electronic edition @ vldb.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/vldb/AmirKN01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/vldb/AmirKN01
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu:
Analyzing Quantitative Databases: Image is Everything. VLDB 2001: 89-98

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.