4266 search results - page 808 / 854 » Search for More Declarativity |
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
CPM
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
DILS
2008
Springer
13 years 9 months ago
2008
Springer
It is not always clear how best to represent integrated data sets, and which application and database features allow a scientist to take best advantage of data coming from various ...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
We present SHIRI-Annot an automatic ontology-driven and unsupervised approach for the semantic annotation of documents which contain well structured parts and not well structured o...
ALENEX
2010
13 years 9 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...