#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2003

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Paul M. B. Vitányi, Frank J. Balbach, Rudi Cilibrasi, Ming Li
- ArXiv
- 2008

The normalized information distance is a universal distance measure for objects of all kinds. It is based on Kolmogorov complexity and thus uncomputable, but there are ways to utilize it. First, compression algorithms can be used to approximate the Kolmogorov complexity if the objects have a string representation. Second, for names and abstract concepts,… (More)

- Frank J. Balbach, Thomas Zeugmann
- LATA
- 2009

The present paper surveys recent developments in algorithmic teaching. First, the traditional teaching dimension model is recalled. Starting from the observation that the teaching dimension model sometimes leads to counterintuitive results, recently developed approaches are presented. Here, main emphasis is put on the following aspects derived from human… (More)

- Frank J. Balbach
- Theor. Comput. Sci.
- 2008

The automation of the entire NMR protein structure determination process requires a superior error tolerant backbone resonance assignment method. Although a variety of assignment approaches have been developed, none works well on noisy automatically picked peaks. IPASS is proposed as a novel integer linear programming (ILP) based assignment method. In order… (More)

- Frank J. Balbach, Thomas Zeugmann
- COLT
- 2006

The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of various parameters such as the learner’s memory size, its ability to provide or to not provide feedback, and the influence of the order in which examples are presented.… (More)

- Frank J. Balbach, Thomas Zeugmann
- ALT
- 2005

Within learning theory teaching has been studied in various ways. In a common variant the teacher has to teach all learners that are restricted to output only consistent hypotheses. The complexity of teaching is then measured by the maximum number of mistakes a consistent learner can make until successful learning. This is equivalent to the so-called… (More)

The normalized information distance is a universal distance measure for objects of all kinds. It is based on Kolmogorov complexity and thus uncomputable, but there are ways to utilize it. First, compression algorithms can be used to approximate the Kolmogorov complexity if the objects have a string representation. Second, for names and abstract concepts,… (More)

- Babak Alipanahi, Xin Gao, +5 authors Ming Li
- J. Bioinformatics and Computational Biology
- 2011

Error tolerant backbone resonance assignment is the cornerstone of the NMR structure determination process. Although a variety of assignment approaches have been developed, none works sufficiently well on noisy fully automatically picked peaks to enable the subsequent automatic structure determination steps. We have designed an integer linear programming… (More)

- Frank J. Balbach
- COLT
- 2005

- Frank J. Balbach, Thomas Zeugmann
- ALT
- 2006

The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided and, based on it, optimal teaching teaching times for certain classes are established. Second, the problem of determining the optimal teaching time is shown to be NP-hard. Third,… (More)