698 search results - page 138 / 140 » dagstuhl 2007 |
DAGSTUHL
2007
13 years 11 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
DAGSTUHL
2007
13 years 11 months ago
2007
In order to prevent emergencies or critical situations where humans are the origin, a timely provision of information thus obtained for the coordinating services and the on-site st...
DAGSTUHL
2007
13 years 11 months ago
2007
In this paper parallel universes are defined by their relation to multi-criteria optimization combined with an explicit or implicit link for the unambiguous identification of an ...
DAGSTUHL
2007
13 years 11 months ago
2007
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
DAGSTUHL
2007
13 years 11 months ago
2007
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...