|
Search the dblp DataBase
Dieter Mitsche:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Johann Eder, Christian Koncilia, Dieter Mitsche
Analysing Slices of Data Warehouses to Detect Structural Modifications. [Citation Graph (0, 0)][DBLP] CAiSE, 2004, pp:492-505 [Conf]
- Johann Eder, Christian Koncilia, Dieter Mitsche
Automatic Detection of Structural Changes in Data Warehouses. [Citation Graph (0, 0)][DBLP] DaWaK, 2003, pp:119-128 [Conf]
- Joachim Giesen, Dieter Mitsche
Reconstructing Many Partitions Using Spectral Techniques. [Citation Graph (0, 0)][DBLP] FCT, 2005, pp:433-444 [Conf]
- Joachim Giesen, Dieter Mitsche
Boosting Spectral Partitioning by Sampling and Iteration. [Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:473-482 [Conf]
- Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
Off-line Admission Control for Advance Reservations in Star Networks. [Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:211-224 [Conf]
- Joachim Giesen, Dieter Mitsche
Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:409-420 [Conf]
- Joachim Giesen, Dieter Mitsche, Eva Schuberth
Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation. [Citation Graph (0, 0)][DBLP] AAIM, 2007, pp:58-67 [Conf]
- Josep Díaz, Dieter Mitsche, Xavier Pérez
Dynamic Random Geometric Graphs [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Josep Díaz, Dieter Mitsche, Xavier Pérez
Sharp threshold for hamiltonicity of random geometric graphs [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
On the Number of Higher Order Delaunay Triangulations. [Citation Graph (, )][DBLP]
A new upper bound for 3-SAT. [Citation Graph (, )][DBLP]
On the connectivity of dynamic random geometric graphs. [Citation Graph (, )][DBLP]
On the Power of Mediators. [Citation Graph (, )][DBLP]
On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs [Citation Graph (, )][DBLP]
A new upper bound for 3-SAT [Citation Graph (, )][DBLP]
On the Number of Higher Order Delaunay Triangulations [Citation Graph (, )][DBLP]
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks [Citation Graph (, )][DBLP]
Colorings at minimum cost. [Citation Graph (, )][DBLP]
Online balanced graph avoidance games. [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.007secs
|