Остановите войну!
for scientists:
default search action
Alexander Hinneburg
- > Home > Persons > Alexander Hinneburg
Publications
- 2004
- [j5]Martin Heczko, Alexander Hinneburg, Daniel A. Keim, Markus Wawryniuk:
Multiresolution similarity search in image databases. Multim. Syst. 10(1): 28-40 (2004) - 2003
- [j4]Alexander Hinneburg, Daniel A. Keim, Markus Wawryniuk:
Using projections to visually cluster high-dimensional data. Comput. Sci. Eng. 5(2): 14-25 (2003) - [j3]Alexander Hinneburg, Daniel A. Keim:
A General Approach to Clustering in Large Databases with Noise. Knowl. Inf. Syst. 5(4): 387-415 (2003) - [c15]Alexander Hinneburg, Daniel A. Keim:
Visual interaction to solving complex optimization problems. Data Visualization: The State of the Art 2003: 407-422 - [c14]Alexander Hinneburg, Daniel A. Keim, Markus Wawryniuk:
HD-Eye - Visual Clustering of High dimensional Data. ICDE 2003: 753-755 - 2002
- [c11]Daniel A. Keim, Martin Heczko, Alexander Hinneburg, Markus Wawryniuk:
Multi-Resolution Similarity Search in Image Databases. Multimedia Information Systems 2002: 76-85 - [c10]Alexander Hinneburg, Daniel A. Keim, Markus Wawryniuk:
HD-Eye: visual clustering of high dimensional data. SIGMOD Conference 2002: 629 - 2001
- [c9]Charu C. Aggarwal, Alexander Hinneburg, Daniel A. Keim:
On the Surprising Behavior of Distance Metrics in High Dimensional Spaces. ICDT 2001: 420-434 - 2000
- [j2]Daniel A. Keim, Alexander Hinneburg:
Interesting KDD-News from SIGMOD'99. SIGKDD Explor. 1(2): 117 (2000) - [c8]Alexander Hinneburg, Daniel A. Keim, Wolfgang Brandt:
Clustering 3D-structures of Small Aminoacid-chains for Detecting Dependence from Their Sequential Context in Proteins. BIBE 2000: 43-49 - [c6]Alexander Hinneburg, Charu C. Aggarwal, Daniel A. Keim:
What Is the Nearest Neighbor in High Dimensional Spaces? VLDB 2000: 506-515 - 1999
- [j1]Alexander Hinneburg, Daniel A. Keim, Markus Wawryniuk:
HD-Eye: Visual Mining of High-Dimensional Data. IEEE Computer Graphics and Applications 19(5): 22-31 (1999) - [c5]Daniel A. Keim, Alexander Hinneburg:
Clustering Techniques for Large Data Sets - from the Past to the Future. KDD Tutorial Notes 1999: 141-181 - [c4]Alexander Hinneburg, Daniel A. Keim:
Clustering Methods for Large Databases: From the Past to the Future. SIGMOD Conference 1999: 509 - [c3]Alexander Hinneburg, Daniel A. Keim:
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering. VLDB 1999: 506-517 - 1998
- [c2]Alexander Hinneburg, Daniel A. Keim, Wolfgang Brandt:
Detecting relationships between amino acid residue sequences and 3D protein structures based on a new class of rotamer libraries. German Conference on Bioinformatics 1998 - [c1]Alexander Hinneburg, Daniel A. Keim:
An Efficient Approach to Clustering in Large Multimedia Databases with Noise. KDD 1998: 58-65
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint