Sciweavers

10048 search results - page 1950 / 2010
» The Structure and Performance of Interpreters
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
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...
Bodo Manthey, Till Tantau
DATESO
2007
107views Database» more  DATESO 2007»
13 years 10 months ago
Updating Typed XML Documents Using a Functional Data Model
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
Pavel Loupal
DGO
2007
168views Education» more  DGO 2007»
13 years 10 months ago
A distributed event-triggered knowledge sharing system
Government agencies globally are facing problems such as illegal immigration, terrorism, and disease diagnosis and control. Solutions to these problems rely heavily on collaborati...
Seema Degwekar, Jeff DePree, Stanley Y. W. Su, How...
ESANN
2007
13 years 10 months ago
Toward a robust 2D spatio-temporal self-organization
Abstract. Several models have been proposed for spatio-temporal selforganization, among which the TOM model by Wiemer [1] is particularly promising. In this paper, we propose to ad...
Thomas Girod, Laurent Bougrain, Frédé...
ECIR
2008
Springer
13 years 10 months ago
A Comparison of Social Bookmarking with Traditional Search
Abstract. Social bookmarking systems allow users to store links to internet resources on a web page. As social bookmarking systems are growing in popularity, search algorithms have...
Beate Krause, Andreas Hotho, Gerd Stumme
« Prev « First page 1950 / 2010 Last » Next »