As the Web continues to grow, it has become increasingly difficult to search for relevant information using traditional search engines. Topic-specific search engines provide an al...
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
With the growing popularity of information retrieval (IR) in distributed systems and in particular P2P Web search, a huge number of protocols and prototypes have been introduced i...
Thomas Neumann, Matthias Bender, Sebastian Michel,...