1729 search results - page 285 / 346 » Generic Haskell: Applications |
100
click to vote
POS
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Defining persistence in terms of reachability is fundamental to achieving orthogonality of persistence. It is implicit to the principles of orthogonal persistence and is ...
142
click to vote
VLDB
1997
ACM
15 years 6 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
138
Voted
VISUALIZATION
1995
IEEE
15 years 6 months ago
1995
IEEE
Animportantgoalofvisualizationtechnologyistosupport the exploration and analysis of very large amounts of data. In this paper, we propose a new visualization technique called ‘r...
115
click to vote
EDBTW
2010
Springer
15 years 6 months ago
2010
Springer
The vision of dataspaces has been articulated as providing various of the benefits of classical data integration but with reduced up-front costs, which, combined with opportunitie...
140
Voted
EUROPAR
2009
Springer
15 years 6 months ago
2009
Springer
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...