562 search results - page 82 / 113 » Ordered Sets in the Calculus of Data Structures |
SEMWEB
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
COMSIS
2007
14 years 9 months ago
2007
The aim of this paper is to discuss how our pattern-based strategy for the visualization of data and control flow can effectively be used to animate the program and exhibit its beh...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
CN
1998
14 years 9 months ago
1998
The World Wide Web currently has a huge amount of data, with practically no classification information, and this makes it extremely difficult to handle effectively. It has been re...
182
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...